Browsing "Computer Science: Conference papers" by Author rp00105

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Showing results 83 to 102 of 131 < previous   next >
TitleAuthor(s)Issue DateViews
A hybrid simulated annealing algorithm for container loading problem
Proceeding/Conference:2009 World Summit on Genetic and Evolutionary Computation, 2009 GEC Summit - Proceedings of the 1st ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC'09
2009
151
 
Hierarchical motion estimation based on visual patterns for video coding
Proceeding/Conference:ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
1996
Generalized planted (l,d)-motif problem with negative set
Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2005
105
Frequency allocation problems for linear cellular networks
Proceeding/Conference:Lecture Notes in Computer Science
2006
141
 
Finding the medial axis of a simple polygon in linear time
Proceeding/Conference:Proceedings of the 6th International Symposium on Algorithms and Computation (ISAAC '95), Cairns, Australia, Lecture Notes in Computer Science 1004
1995
101
 
Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
Proceeding/Conference:Proceedings of the Third Annual European Symposium on Algorithms- ESA '95, Springer Verlag Lecture Notes in Computer Science 979, Corfu, Greece
1995
38
 
2009
203
Finding motifs for insufficient number of sequences with strong binding to transcription factor
Proceeding/Conference:RECOMB 2004 - Proceedings of the Eighth Annual International Conference on Research in Computational Molecular Biology
2004
91
Finding linear motif pairs from protein interaction networks: a probabilistic approach.
Proceeding/Conference:Computational Systems Bioinformatics Conference Proceedings
2007
104
 
Finding Linear Motif Pair from Protein Interaction Networks: A Probabilistic Approach
Proceeding/Conference:The 6th Annual International Conference on Computational Systems Bioinformatics Conference (CSB 2007)
2007
86
 
A Faster Algorithm for Finding Disjoint Pattrs in Grids
Proceeding/Conference:Proceedings of the 10th International Symposium on Algorithms and Computation, ISAAC'99
1999
 
Explicit contour model for vehicle tracking with automatic hypothesis validation
Proceeding/Conference:Proceedings of the IEEE International Conference on Image Processing
2005
124
 
Experiences in Running a Flexible, Web-Based, and Self-Paced Course (Keynote)
Proceeding/Conference:International Workshop on Education Technology and Computer Science (ETCS 2011)
2011
17
 
Experiences in Running a Flexible, Web-Based, and Self-Paced Course
Proceeding/Conference:The First International Conference on Advances in Web-Based Learning (ICWL 2002)
2002
103
 
Escaping a grid by edge-disjoint paths
Proceeding/Conference:Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms
2000
 
Efficient block-based motion segmentation method using motion vector consistency
Proceeding/Conference:Proceedings of the IAPR Conference on Machine Vision Applications
2005
56
 
Efficient algorithms for finding disjoint paths in grids
Proceeding/Conference:Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
1997
89
 
An Efficient Algorithm for Transversal of Disjoint Convex Polygons
Proceeding/Conference:Proceedings of the 2000 International Computer Symposium Workshop on Algorithms and Theory of Computation
2000
93
 
An efficient algorithm for the extended (l,d)-motif problem with unknown number of binding sites
Proceeding/Conference:Proceedings - BIBE 2005: 5th IEEE Symposium on Bioinformatics and Bioengineering
2005
102
An efficient algorithm for string motif discovery
Proceeding/Conference:Series on Advances in Bioinformatics and Computational Biology
2006
117