152 search results - page 28 / 31 » Tetris is Hard, Even to Approximate |
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
IPSN
2010
Springer
14 years 3 months ago
2010
Springer
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
CVPR
2009
IEEE
14 years 3 months ago
2009
IEEE
Illuminant estimation from shadows typically relies on accurate segmentation of the shadows and knowledge of exact 3D geometry, while shadow estimation is difficult in the presen...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...