1952 search results - page 288 / 391 » Complete partitions of graphs |
174
click to vote
INFOCOM
2008
IEEE
16 years 24 days ago
2008
IEEE
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
185
click to vote
LICS
2008
IEEE
16 years 23 days ago
2008
IEEE
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
188
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
212
click to vote
FUN
2010
Springer
15 years 9 months ago
2010
Springer
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
167
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
We present a new approach to appearance-based object recognition, which captures the relationships between multiple model views and exploits them to improve recognition performanc...