1095 search results - page 172 / 219 » Preprocessing of Intractable Problems |
CORR
2012
Springer
12 years 6 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
SIGIR
2012
ACM
12 years 1 months ago
2012
ACM
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
STOC
2007
ACM
14 years 11 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
CPM
2005
Springer
14 years 22 days ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
CVPR
2009
IEEE
15 years 5 months ago
2009
IEEE
In this paper, we address the complex problem of rapid modeling
of large-scale areas and present a novel approach for the automatic
reconstruction of cities from remote sensor da...