Sciweavers

2192 search results - page 63 / 439
» Algorithms for Challenging Motif Problems
Sort
View
ICMCS
2000
IEEE
142views Multimedia» more  ICMCS 2000»
14 years 15 days ago
Incorporate Discriminant Analysis with EM Algorithm in Image Retrieval
One of the difficulties of Content-Based Image Retrieval (CBIR) is the gap between high-level concepts and low-level image features, e.g., color and texture. Relevance feedback wa...
Qi Tian, Ying Wu, Thomas S. Huang
IPPS
1999
IEEE
14 years 12 days ago
A Parallel Algorithm for Bound-Smoothing
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...
Kumar Rajan, Narsingh Deo
SPAA
2004
ACM
14 years 1 months ago
Online algorithms for prefetching and caching on parallel disks
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter
ICDCIT
2012
Springer
12 years 3 months ago
Decision Making as Optimization in Multi-robot Teams
Abstract. A key challenge in multi-robot teaming research is determining how to properly enable robots to make decisions on actions they should take to contribute to the overall sy...
Lynne E. Parker
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
14 years 2 months ago
Approximating the Crossing Number of Toroidal Graphs
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
Petr Hlinený, Gelasio Salazar