Sciweavers

2745 search results - page 345 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
DA
2010
123views more  DA 2010»
15 years 2 months ago
Paradoxes in Learning and the Marginal Value of Information
We consider the Bayesian ranking and selection problem, in which one wishes to allocate an information collection budget as efficiently as possible to choose the best among severa...
Peter Frazier, Warren B. Powell
155
Voted
DAC
2008
ACM
16 years 7 months ago
Faster symmetry discovery using sparsity of symmetries
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
Paul T. Darga, Karem A. Sakallah, Igor L. Markov
KIVS
2009
Springer
16 years 21 days ago
Providing Probabilistic Latency Bounds for Dynamic Publish/Subscribe Systems
In the context of large decentralized many-to-many communication systems it is impractical to provide realistic and hard bounds for certain QoS metrics including latency bounds. Ne...
M. Adnan Tariq, Boris Koldehofe, Gerald G. Koch, K...
CVPR
2007
IEEE
16 years 8 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
ICCV
2001
IEEE
16 years 8 months ago
Plane-based Projective Reconstruction
A linear method for computing a projective reconstruction from a large number of images is presented and then evaluated. The method uses planar homographies between views to linea...
Robert Kaucic, Richard I. Hartley, Nicolas Y. Dano