Sciweavers

810 search results - page 127 / 162
» Image similarity search with compact data structures
Sort
View
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 3 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
CP
2007
Springer
15 years 5 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
JMLR
2012
13 years 1 months ago
Active Clustering of Biological Sequences
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
CIKM
2011
Springer
13 years 11 months ago
Ranking-based processing of SQL queries
A growing number of applications are built on top of search engines and issue complex structured queries. This paper contributes a customisable ranking-based processing of such qu...
Hany Azzam, Thomas Roelleke, Sirvan Yahyaei
IPMI
1999
Springer
15 years 12 months ago
Co-dimension 2 Geodesic Active Contours for MRA Segmentation
Abstract. Automatic and semi-automatic magnetic resonance angiography (MRA) segmentation techniques can potentially save radiologists large amounts of time required for manual segm...
Liana M. Lorigo, Olivier D. Faugeras, W. Eric L. G...