1772 search results - page 197 / 355 » Classifying Problems into Complexity Classes |
ICIP
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper a novel non-linear subspace method for face verification is proposed. The problem of face verification is considered as a two-class problem (genuine versus imposto...
97
Voted
COCO
2007
Springer
15 years 7 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
105
Voted
ICWE
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. To build high-quality personalized Web applications developers have to deal with a number of complex problems. We look at the growing class of personalized Web Applicatio...
126
Voted
CORR
2007
Springer
15 years 23 days ago
2007
Springer
For digraphs G and H, a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (G) is associated ...
106
Voted
CDC
2008
IEEE
15 years 2 months ago
2008
IEEE
In this paper, we present a series of distributed algorithms for coverage verification in sensor networks with no location information. We demonstrate how, in the absence of locali...