Sciweavers

117 search results - page 8 / 24
» Query suggestion using hitting time
Sort
View
COMPGEOM
2009
ACM
14 years 1 months ago
Shooting permanent rays among disjoint polygons in the plane
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...
Mashhood Ishaque, Bettina Speckmann, Csaba D. T&oa...
EDBT
2009
ACM
118views Database» more  EDBT 2009»
13 years 11 months ago
Flower-CDN: a hybrid P2P overlay for efficient query processing in CDN
Many websites with a large user base, e.g., websites of nonprofit organizations, do not have the financial means to install large web-servers or use specialized content distributi...
Manal El Dick, Esther Pacitti, Bettina Kemme
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
14 years 7 months ago
Spotting out emerging artists using geo-aware analysis of P2P query strings
Record label companies would like to identify potential artists as early as possible in their careers, before other companies approach the artists with competing contracts. The va...
Noam Koenigstein, Yuval Shavitt, Tomer Tankel
ICDT
2005
ACM
124views Database» more  ICDT 2005»
14 years 25 days ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
14 years 28 days ago
The Quality vs. Time Trade-off for Approximate Image Descriptor Search
In recent years, content-based image retrieval has become more and more important in many application areas. Similarity retrieval is inherently a very demanding process, in partic...
Rut Siguroardottir, Björn Þór J&...