Sciweavers

820 search results - page 85 / 164
» Finding low-utility data structures
Sort
View
DEBU
2010
108views more  DEBU 2010»
13 years 9 months ago
Weighted Set-Based String Similarity
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
Marios Hadjieleftheriou, Divesh Srivastava
PR
2006
132views more  PR 2006»
13 years 8 months ago
Some approaches to improve tree-based nearest neighbour search algorithms
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
Eva Gómez-Ballester, Luisa Micó, Jos...
MICCAI
2004
Springer
14 years 9 months ago
Geometric Flows for Segmenting Vasculature in MRI: Theory and Validation
Abstract. Often in neurosurgical planning a dual spin echo acquisition is performed that yields proton density (PD) and T2-weighted images to evaluate edema near a tumor or lesion....
Maxime Descoteaux, D. Louis Collins, Kaleem Siddiq...
ICDE
2008
IEEE
159views Database» more  ICDE 2008»
14 years 10 months ago
Fast Graph Pattern Matching
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...
Jiefeng Cheng, Jeffrey Xu Yu, Bolin Ding, Philip S...
SDM
2004
SIAM
141views Data Mining» more  SDM 2004»
13 years 10 months ago
Visually Mining through Cluster Hierarchies
Similarity search in database systems is becoming an increasingly important task in modern application domains such as multimedia, molecular biology, medical imaging, computer aid...
Stefan Brecheisen, Hans-Peter Kriegel, Peer Kr&oum...