1201 search results - page 127 / 241 » Linear Probing and Graphs |
96
Voted
VISUALIZATION
2000
IEEE
15 years 5 months ago
2000
IEEE
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...
GD
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...
76
Voted
AML
2005
15 years 20 days ago
2005
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...
96
Voted
ICIP
2006
IEEE
16 years 2 months ago
2006
IEEE
A novel procedure for in-silico (virtual) craniofacial reconstruction of human mandibles with multiple fractures from a sequence of Computed Tomography (CT) images is presented. T...
DCC
2002
IEEE
16 years 10 days ago
2002
IEEE
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...