2354 search results - page 446 / 471 » Radio number for trees |
156
click to vote
FOCS
2007
IEEE
16 years 13 days ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
176
click to vote
APPROX
2007
Springer
16 years 8 days ago
2007
Springer
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
165
Voted
ATAL
2007
Springer
16 years 8 days ago
2007
Springer
We develop a model of normative systems in which agents are assumed to have multiple goals of increasing priority, and investigate the computational complexity and game theoretic ...
191
click to vote
ICB
2007
Springer
16 years 7 days ago
2007
Springer
Effective and real-time face detection has been made possible by using the method of rectangle Haar-like features with AdaBoost learning since Viola and Jones’ work [12]. In this...
190
click to vote
WADS
2007
Springer
16 years 6 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...