Sciweavers

1604 search results - page 93 / 321
» Approximation algorithms for developable surfaces
Sort
View
ECCV
1992
Springer
16 years 3 months ago
Determining Three-Dimensional Shape from Orientation and Spatial Frequency Disparities
Abstract. Binocular di erences in orientation and foreshortening are systematically related to surface slant and tilt and could potentially be exploited by biological and machine v...
David G. Jones, Jitendra Malik
PODC
2012
ACM
13 years 3 months ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
AUTOMATICA
2006
67views more  AUTOMATICA 2006»
15 years 1 months ago
Numerical methods for controlled regime-switching diffusions and regime-switching jump diffusions
This work is concerned with numerical methods for controlled regime-switching diffusions, and regime-switching jump diffusions. Numerical procedures based on Markov chain approxim...
Q. S. Song, Gang George Yin, Z. Zhang
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 2 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
94
Voted
ICDE
2010
IEEE
188views Database» more  ICDE 2010»
16 years 1 months ago
Space-efficient Online Approximation of Time Series Data: Streams, Amnesia, and Out-of-order
In this paper, we present an abstract framework for online approximation of time-series data that yields a unified set of algorithms for several popular models: data streams, amnes...
Sorabh Gandhi, Luca Foschini, Subhash Suri