5138 search results - page 15 / 1028 » Randomized Algorithms for 3-SAT |
WAW
2010
Springer
13 years 7 months ago
2010
Springer
ICCV
2007
IEEE
14 years 4 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
SOFSEM
2007
Springer
14 years 3 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
DAC
1998
ACM
14 years 10 months ago
1998
ACM
Abstract-Our strategy for automatic generation of functional vectors is based on exercising selected paths in the given hardware description language (HDL) model. The HDL model des...
CIAC
2003
Springer
14 years 3 months ago
2003
Springer
In the Art Gallery problem, given is a polygonal gallery and the goal is to guard the gallery’s interior or walls with a number of guards that must be placed strategically in the...