Sciweavers

1486 search results - page 233 / 298
» Algorithms for two-box covering
Sort
View
CVPR
2006
IEEE
15 years 26 days ago
The Layout Consistent Random Field for Recognizing and Segmenting Partially Occluded Objects
This paper addresses the problem of detecting and segmenting partially occluded objects of a known category. We first define a part labelling which densely covers the object. Our ...
John M. Winn, Jamie Shotton
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
15 years 6 days ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
ICDE
2007
IEEE
109views Database» more  ICDE 2007»
15 years 6 days ago
Evaluating Proximity Relations Under Uncertainty
For location-based services it is often essential to efficiently process proximity relations among mobile objects, such as to establish whether a group of friends or family member...
Zhengdao Xu, Hans-Arno Jacobsen
ICDE
2005
IEEE
156views Database» more  ICDE 2005»
15 years 6 days ago
Reverse Nearest Neighbors in Large Graphs
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Y...
ICDE
2004
IEEE
88views Database» more  ICDE 2004»
15 years 6 days ago
Group Nearest Neighbor Queries
Given two sets of points P and Q, a group nearest neighbor (GNN) query retrieves the point(s) of P with the smallest sum of distances to all points in Q. Consider, for instance, t...
Dimitris Papadias, Qiongmao Shen, Yufei Tao, Kyria...