Sciweavers

406 search results - page 39 / 82
» A Cost Model for Similarity Queries in Metric Spaces
Sort
View
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 7 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 7 months ago
Efficient Clustering with Limited Distance Information
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 ...
CISIS
2008
IEEE
14 years 2 months ago
Segmentation of the Liver from Abdominal CT Using Markov Random Field Model and GVF Snakes
Liver segmentation from scans of the abdominal area is an important step in several diagnostic processes. CT scans of the abdominal area contain several organs in close proximity ...
Raja' S. Alomari, Suryaprakash Kompalli, Vipin Cha...
SAC
2006
ACM
14 years 1 months ago
Efficient query routing for information retrieval in semantic overlays
A fundamental problem in peer-to-peer networks is how to locate appropriate peers efficiently to answer a specific query request. This paper proposes a model in which semantically...
Hai Jin, Xiaoming Ning, Hanhua Chen, Zuoning Yin
CIKM
2009
Springer
14 years 7 days ago
Answering XML queries using materialized views revisited
Answering queries using views is a well-established technique in databases. In this context, two outstanding problems can be formulated. The first one consists in deciding whethe...
Xiaoying Wu, Dimitri Theodoratos, Wendy Hui Wang