Publications
Export 3364 results:
Author [ Title] Type Year Filters: First Letter Of Last Name is S [Clear All Filters]
2009. Computational linguistics for metadata building (CLiMB): using text mining for the automatic identification, categorization, and disambiguation of subject terms for image metadata. Multimedia Tools and Applications. 42(1):115-138.
2002. Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I. :586-625.
2011. A computational statistics approach for estimating the spatial range of morphogen gradients. Development. 138(22):4867-4874.
2011. A computational statistics approach for estimating the spatial range of morphogen gradients. Development. 138(22):4867-4874.
1998. Computational studies of lateralization of phoneme sequence generation. Neural Computation. 10(5):1277-1297.
2016. Computational study of the inhibitory mechanism of the kinase CDK5 hyperactivity by peptide p5 and derivation of a pharmacophore. Journal of Computer-Aided Molecular Design. 30(6):513-521.
2007. A computational survey of candidate exonic splicing enhancer motifs in the model plant Arabidopsis thaliana. BMC Bioinformatics. 8(1):159-159.
2005. Computer vision on FPGAs: Design methodology and its application to gesture recognition. Computer Vision and Pattern Recognition-Workshops, 2005. CVPR Workshops. IEEE Computer Society Conference on. :133-133.
2005. Computer vision on FPGAs: Design methodology and its application to gesture recognition. Computer Vision and Pattern Recognition-Workshops, 2005. CVPR Workshops. IEEE Computer Society Conference on. :133-133.
2005. Computer vision on FPGAs: Design methodology and its application to gesture recognition. Computer Vision and Pattern Recognition-Workshops, 2005. CVPR Workshops. IEEE Computer Society Conference on. :133-133.
1987. Computer-supported cooperative work (panel): is this REALLY a new field of research? Proceedings of the SIGCHI/GI conference on Human factors in computing systems and graphics interface. :227-228.
2007. Computing most probable worlds of action probabilistic logic programs: scalable estimation for 10^30,000 worlds. Annals of Mathematics and Artificial Intelligence. 51(2):295-331.
2007. Computing most probable worlds of action probabilistic logic programs: scalable estimation for 10^30,000 worlds. Annals of Mathematics and Artificial Intelligence. 51(2):295-331.
2007. Computing most probable worlds of action probabilistic logic programs: scalable estimation for 10^30,000 worlds. Annals of Mathematics and Artificial Intelligence. 51(2):295-331.
1999. Computing nearest neighbors for moving points and applications to clustering. Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms. :931-932.
1990. Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices. Journal of Computational Physics. 90(2):497-505.
1994. Computing with very weak random sources. , 35th Annual Symposium on Foundations of Computer Science, 1994 Proceedings. :264-275.
2010. Concentration of measure for the analysis of randomized algorithms by Devdatt P. Dubhashi and Alessandro Panconesi Cambridge University Press, 2009. SIGACT News. 41(1):28-30.
2007. Concept disambiguation for improved subject access using multiple knowledge sources. Proceedings of the Workshop on Language Technology for Cultural Heritage Data (LaTeCH 2007). :25-25.
1996. The Concurrency Factory: A development environment for concurrent systems. Computer Aided Verification. :398-401.
1996. The Concurrency Factory: A development environment for concurrent systems. Computer Aided Verification. :398-401.