4865 search results - page 631 / 973 » The Complexity of Graph Connectivity |
173
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
296
click to vote
LCC
1994
15 years 10 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
182
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
This paper presents a novel method to model and recognize human faces in video sequences. Each registered person is represented by a low-dimensional appearance manifold in the amb...
167
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....
137
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
—Connecting system-level performance models with circuit information has been a long-standing problem in analog/mixed-signal front-ends, like radios and high-speed links. High-sp...