3204 search results - page 177 / 641 » The Alcuin Number of a Graph |
IWDC
2005
Springer
14 years 1 months ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
GD
2009
Springer
14 years 29 days ago
2009
Springer
We show that cr(G) ≤ 2 iocr(G) 2 settling an open problem of Pach and T´oth [4, 1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2. 1 Crossing Numbers Pach and T´oth point out in ...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-...
CP
2009
Springer
14 years 9 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...