28888 search results - page 5381 / 5778 » Computability and complexity in analysis |
186
click to vote
CVPR
1997
IEEE
15 years 11 months ago
1997
IEEE
The surface growing framework presented by Besl and Jain [2] has served as the basis for many range segmentation techniques. It has been augmented with alternative fitting techni...
233
click to vote
MICCAI
1998
Springer
15 years 11 months ago
1998
Springer
This paper describes a method for creating object surfaces from binary-segmented data that are free from aliasing and terracing artifacts. In this method, a net of linked surface n...
188
Voted
WG
1998
Springer
15 years 11 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
190
click to vote
PPOPP
1997
ACM
15 years 11 months ago
1997
ACM
Global addressing of shared data simplifies parallel programming and complements message passing models commonly found in distributed memory machines. A number of programming sys...
237
click to vote
ECBS
1996
IEEE
15 years 11 months ago
1996
IEEE
In this paper, it is shown that, through the use of Model-Integrated Program Synthesis MIPS, parallel real-time implementations of image processing data ows can be synthesized fro...