727 search results - page 102 / 146 » Private approximation of search problems |
104
Voted
CEC
2010
IEEE
15 years 1 months ago
2010
IEEE
Embodying robot morphologies evolved in simulation can present serious problems for an engineer when translating simplified simulated mechanisms into working devices, often drawing...
116
Voted
WWW
2009
ACM
16 years 1 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
122
Voted
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
240
click to vote
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
111
Voted
STOC
2001
ACM
16 years 1 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...