1215 search results - page 211 / 243 » Combinatorics |
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
When a switching network topology is used for constructing optical cross-connects, as in the circuit switching case, no two routes are allowed to share a link. However, if two rou...
CPM
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
ENDM
2002
14 years 9 months ago
2002
Let k be an integer and M be a closed 2-manifold with Euler characteristic (M) 0. We prove that each polyhedral map G on M with minimum degree and large number of vertices conta...
172
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
Markov random field (MRF, CRF) models are popular in
computer vision. However, in order to be computationally
tractable they are limited to incorporate only local interactions
a...
ECCV
1996
Springer
15 years 11 months ago
1996
Springer
We present a technique to extract complex suburban roofs from sets of aerial images. Because we combine 2-D edge information, photometric and chromatic attributes and 3-D informati...