Sciweavers

528 search results - page 78 / 106
» Degrees of categoricity of computable structures
Sort
View
COMPGEOM
2010
ACM
14 years 1 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
IVC
2007
164views more  IVC 2007»
13 years 8 months ago
Locality preserving CCA with applications to data visualization and pose estimation
- Canonical correlation analysis (CCA) is a major linear subspace approach to dimensionality reduction and has been applied to image processing, pose estimation and other fields. H...
Tingkai Sun, Songcan Chen
ECCV
2006
Springer
14 years 10 months ago
Triangulation for Points on Lines
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
Adrien Bartoli, Jean-Thierry Lapresté
JCSS
2008
90views more  JCSS 2008»
13 years 8 months ago
Fault tolerance in cellular automata at high fault rates
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
Mark McCann, Nicholas Pippenger
RECOMB
2002
Springer
14 years 9 months ago
Inferring Piecewise Ancestral History from Haploid Sequences
There has been considerable recent interest in the use of haplotype structure to aid in the design and analysis of case-control association studies searching for genetic predictors...
Russell Schwartz, Andrew G. Clark, Sorin Istrail