536 search results - page 83 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
SIAMCOMP
2002
13 years 8 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
ALT
2008
Springer
14 years 5 months ago
2008
Springer
In this paper we consider the problem of learning hidden independent cascade social networks using exact value injection queries. These queries involve activating and suppressing a...
ALENEX
2009
13 years 9 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
AAIM
2009
Springer
13 years 6 months ago
2009
Springer
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...