Sciweavers

1390 search results - page 9 / 278
» Computing the depth of a flat
Sort
View
SMA
2006
ACM
120views Solid Modeling» more  SMA 2006»
14 years 2 months ago
Identifying flat and tubular regions of a shape by unstable manifolds
We present an algorithm to identify the flat and tubular regions of a three dimensional shape from its point sample. We consider the distance function to the input point cloud an...
Samrat Goswami, Tamal K. Dey, Chandrajit L. Bajaj
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 8 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...
CVPR
2004
IEEE
14 years 10 months ago
3D Head Tracking Based on Recognition and Interpolation Using a Time-of-Flight Depth Sensor
This paper describes a head-tracking algorithm that is based on recognition and correlation-based weighted interpolation. The input is a sequence of 3D depth images generated by a...
Carlo Tomasi, Salih Burak Göktürk
DSN
2008
IEEE
13 years 10 months ago
Reliability of flat XOR-based erasure codes on heterogeneous devices
XOR-based erasure codes are a computationallyefficient means of generating redundancy in storage systems. Some such erasure codes provide irregular fault tolerance: some subsets o...
Kevin M. Greenan, Ethan L. Miller, Jay J. Wylie
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 8 months ago
Flatness of the Energy Landscape for Horn Clauses
Abstract The Little-Hopfield neural network programmed with Horn clauses is studied. We argue that the energy landscape of the system, corresponding to the inconsistency function f...
Saratha Sathasivam, Wan Ahmad Tajuddin Wan Abdulla...