Sciweavers

190 search results - page 23 / 38
» Providing Diversity in K-Nearest Neighbor Query Results
Sort
View
EDBT
2011
ACM
256views Database» more  EDBT 2011»
12 years 12 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
ICC
2007
IEEE
14 years 2 months ago
Spatially Coordinate-Interleaved Design for Mutually Cooperative Relay Scheme
– In this paper, we consider a novel spatial diversity scheme for a mutually cooperative relay (MCR) system in which two active users are simultaneously communicating with the sa...
Kyungmi Park, Hyun Seok Ryu, Heesoo Lee, Chung Gu ...
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
14 years 9 months ago
Deflating the Dimensionality Curse Using Multiple Fractal Dimensions
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
Bernd-Uwe Pagel, Flip Korn, Christos Faloutsos
MM
2005
ACM
172views Multimedia» more  MM 2005»
14 years 2 months ago
Learning the semantics of multimedia queries and concepts from a small number of examples
In this paper we unify two supposedly distinct tasks in multimedia retrieval. One task involves answering queries with a few examples. The other involves learning models for seman...
Apostol Natsev, Milind R. Naphade, Jelena Tesic
EWCBR
2008
Springer
13 years 10 months ago
Supporting Case-Based Retrieval by Similarity Skylines: Basic Concepts and Extensions
Conventional approaches to similarity search and case-based retrieval, such as nearest neighbor search, require the specification of a global similarity measure which is typically ...
Eyke Hüllermeier, Ilya Vladimirskiy, Bel&eacu...