Sciweavers

360 search results - page 42 / 72
» Indexing the Distance: An Efficient Method to KNN Processing
Sort
View
EDBT
2002
ACM
139views Database» more  EDBT 2002»
14 years 7 months ago
Aggregate Processing of Planar Points
Abstract. Aggregate window queries return summarized information about objects that fall inside a query rectangle (e.g., the number of objects instead of their concrete ids). Tradi...
Yufei Tao, Dimitris Papadias, Jun Zhang
ICASSP
2008
IEEE
14 years 2 months ago
Query by humming of midi and audio using locality sensitive hashing
This paper proposes a query by humming method based on locality sensitive hashing (LSH). The method constructs an index of melodic fragments by extracting pitch vectors from a dat...
Matti Ryynänen, Anssi Klapuri
EUSFLAT
2009
117views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
Type-II Fuzzy Possibilistic C-Mean Clustering
Fuzzy clustering is well known as a robust and efficient way to reduce computation cost to obtain the better results. In the literature, many robust fuzzy clustering models have be...
Mohammad Hossein Fazel Zarandi, Marzie Zarinbal, I...
CVPR
2000
IEEE
14 years 9 months ago
Robust and Efficient Skeletal Graphs
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...
Pavel Dimitrov, Carlos Phillips, Kaleem Siddiqi
SSD
2005
Springer
153views Database» more  SSD 2005»
14 years 1 months ago
Constrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...