728 search results - page 19 / 146 » Efficient Searching with Linear Constraints |
190
click to vote
ICDE
2003
IEEE
16 years 3 months ago
2003
IEEE
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone co...
102
click to vote
ORL
2002
15 years 1 months ago
2002
Dial-a-Ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle operating agency requesting that an item be picked up from a specif...
110
click to vote
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
127
Voted
DPHOTO
2009
14 years 11 months ago
2009
Most digital cameras employ a spatial subsampling process, implemented as a color filter array (CFA), to capture color images. The choice of CFA patterns has a great impact on the...
167
Voted
STOC
1998
ACM
15 years 6 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...