Sciweavers

1458 search results - page 180 / 292
» Monads for incremental computing
Sort
View
CVPR
2008
IEEE
16 years 5 months ago
What can missing correspondences tell us about 3D structure and motion?
Practically all existing approaches to structure and motion computation use only positive image correspondences to verify the camera pose hypotheses. Incorrect epipolar geometries...
Christopher Zach, Arnold Irschara, Horst Bischof
CHI
2008
ACM
16 years 4 months ago
What to do when search fails: finding information by association
Sometimes people cannot remember the names or locations of things on their computer, but they can remember what other things are associated with them. We created Feldspar, the fir...
Duen Horng Chau, Brad A. Myers, Andrew Faulring
CIE
2009
Springer
15 years 10 months ago
On Stateless Multicounter Machines
We investigate the computing power of stateless multicounter machines with reversal-bounded counters. Such a machine has m-counters operating on a one-way input delimited by left a...
Ömer Egecioglu, Oscar H. Ibarra
BDA
2003
15 years 5 months ago
Memory Requirements for Query Execution in Highly Constrained Devices
Pervasive computing introduces data management requirements that must be tackled in a growingvariety of lightweight computing devices. Personal folders on chip, networks of sensor...
Nicolas Anciaux, Luc Bouganim, Philippe Pucheral
PAMI
2010
156views more  PAMI 2010»
15 years 2 months ago
An Adaptive and Stable Method for Fitting Implicit Polynomial Curves and Surfaces
—Representing 2D and 3D data sets with implicit polynomials (IPs) has been attractive because of its applicability to various computer vision issues. Therefore, many IP fitting m...
Bo Zheng, Jun Takamatsu, Katsushi Ikeuchi