2254 search results - page 163 / 451 » Computing the minimal covering set |
171
click to vote
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
179
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
: This paper proposes a novel algorithm for calibrated multi-view stereopsis that outputs a (quasi) dense set of rectangular patches covering the surfaces visible in the input imag...
191
Voted
JNSM
2000
15 years 6 months ago
2000
In this paper, we consider wide-area backbone networks where multiple connection-oriented guaranteed services with differing bandwidth/flow requirements are offered. Specifically,...
176
click to vote
CAD
2004
Springer
15 years 6 months ago
2004
Springer
In recent years, geometry processing algorithms that directly operate on polygonal meshes have become an indispensable tool in computer graphics, CAD/CAM applications, numerical s...
153
click to vote
VVS
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper explores the use of multi-dimensional trees to provide spatial and temporal e ciencies in imaging large data sets. Each node of the tree contains a model of the data in...