16430 search results - page 348 / 3286 » On Computable Tree Functions |
171
click to vote
CVPR
2000
IEEE
16 years 7 months ago
2000
IEEE
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...
150
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art becau...
129
click to vote
SKG
2006
IEEE
15 years 11 months ago
2006
IEEE
Data Grid is one of the important research subjects in the field of Grid Computing. To get a high efficiency of the system, this paper proposes a set of novel multicast algorithms...
137
Voted
GLVLSI
2003
IEEE
15 years 10 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
126
click to vote
GD
2001
Springer
15 years 9 months ago
2001
Springer
We prove that every tree T = (V, E) on n vertices with edges of unit length can be embedded in the plane with distortion O( √ n); that is, we construct a mapping f: V → R2 suc...