62 search results - page 2 / 13 » Doing Good with Spam Is Hard |
CIKM
2007
Springer
13 years 11 months ago
2007
Springer
Index compression techniques are known to substantially decrease the storage requirements of a text retrieval system. As a side-effect, they may increase its retrieval performanc...
ICFCA
2010
Springer
14 years 3 days ago
2010
Springer
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
ECCV
1996
Springer
14 years 7 months ago
1996
Springer
An approach is presented for imposing generic hard constraints on deformable models at a low computational cost, while preserving the good convergence properties of snake-like mod...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...