150 search results - page 28 / 30 » Parameterized Modal Satisfiability |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The tolerancing process links the virtual and the real worlds. From the former, tolerances define a variational geometrical language (geometric parameters). From the latter, there...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we study a maximum likelihood estimation (MLE) approach to preference aggregation and voting when the set of alternatives has a multi-issue structure, and the voter...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
We address the problem of visual category recognition by learning an image-to-image distance function that attempts to satisfy the following property: the distance between images ...
WWW
2006
ACM
14 years 8 months ago
2006
ACM
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...