Sciweavers

2880 search results - page 152 / 576
» Approximate Range Searching
Sort
View
250
Voted
ICDE
2009
IEEE
219views Database» more  ICDE 2009»
16 years 5 months ago
Distance Oracles for Spatial Networks
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
Jagan Sankaranarayanan, Hanan Samet
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
15 years 1 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
WINE
2010
Springer
134views Economy» more  WINE 2010»
15 years 1 months ago
Truthful Mechanisms for Exhibitions
We consider the following combinatorial auction: Given a range space (U, R), and m bidders interested in buying only ranges in R, each bidder j declares her bid bj : R R+. We give...
George Christodoulou, Khaled M. Elbassioni, Mahmou...
100
Voted
CN
2002
112views more  CN 2002»
15 years 3 months ago
Performance evaluation of a queue fed by a Poisson Pareto burst process
This paper provides means for performance evaluation of a queue with Poisson Pareto Burst Process (PPBP) input. Because of the long range dependent nature of the PPBP, straightfor...
Ron Addie, Timothy D. Neame, Moshe Zukerman
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
16 years 4 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...