16666 search results - page 3134 / 3334 » Descriptive and Computational Complexity |
183
click to vote
MICCAI
1998
Springer
15 years 9 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...
143
click to vote
WG
1998
Springer
15 years 9 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...
133
click to vote
DAC
1997
ACM
15 years 9 months ago
1997
ACM
A number of industry trends are shaping the requirements for IC and electronic equipment design. The density and complexity of circuit technologies have increased to a point where...
145
Voted
PPOPP
1997
ACM
15 years 9 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...
200
Voted
ECBS
1996
IEEE
15 years 9 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...