Sciweavers

254 search results - page 26 / 51
» On the randomized solution of initial value problems
Sort
View
CVPR
2011
IEEE
13 years 4 months ago
Discrete-Continuous Optimization for Large-scale Structure from Motion
Recent work in structure from motion (SfM) has successfully built 3D models from large unstructured collections of images downloaded from the Internet. Most approaches use increme...
David Crandall, Andrew Owens, Noah Snavely, Daniel...
ALGORITHMICA
1999
156views more  ALGORITHMICA 1999»
13 years 8 months ago
Competitive Optimal On-Line Leasing
Consider an on-line player who needs some equipment (e.g., a computer) for an initially unknown number of periods. At the start of each period it is determined whether the player w...
Ran El-Yaniv, R. Kaniel, Nathan Linial
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
13 years 8 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
IEICET
2007
131views more  IEICET 2007»
13 years 8 months ago
High Accuracy Fundamental Matrix Computation and Its Performance Evaluation
We compare the convergence performance of different numerical schemes for computing the fundamental matrix from point correspondences over two images. First, we state the problem ...
Ken-ichi Kanatani, Yasuyuki Sugaya
AI
1998
Springer
14 years 1 months ago
A Heuristic Incremental Modeling Approach to Course Timetabling
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
Don Banks, Peter van Beek, Amnon Meisels