7106 search results - page 1120 / 1422 » Restricted Complexity, General Complexity |
202
click to vote
CORR
2007
Springer
15 years 6 months 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 ...
172
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— The fairness of IEEE 802.11 wireless networks (including Wireless LAN and Ad-hoc networks) is hard to predict and control because of the randomness and complexity of the MAC co...
171
click to vote
IVC
2006
15 years 6 months ago
2006
In this work we consider face recognition from Face Motion Manifolds (FMMs). The use of the Resistor-Average Distance (RAD) as a dissimilarity measure between densities confined t...
166
click to vote
JACM
2006
15 years 6 months ago
2006
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
178
click to vote
JAIR
2006
15 years 6 months ago
2006
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...