Sciweavers

2745 search results - page 14 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
FOCS
1998
IEEE
13 years 11 months ago
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
Naveen Garg, Jochen Könemann
TNN
2010
148views Management» more  TNN 2010»
13 years 2 months ago
A fast algorithm for robust mixtures in the presence of measurement errors
Abstract--In experimental and observational sciences, detecting atypical, peculiar data from large sets of measurements has the potential of highlighting candidates of interesting ...
Jianyong Sun, Ata Kabán
ICCV
2009
IEEE
15 years 11 days ago
Least-Squares Congealing for Large Numbers of Images
In this paper we pursue the task of aligning an ensemble of images in an unsupervised manner. This task has been commonly referred to as “congealing” in literature. A form o...
Mark Cox, Sridha Sridharan, Simon Lucey, Jeffrey C...
ASAP
1996
IEEE
94views Hardware» more  ASAP 1996»
13 years 11 months ago
A New Euclidean Division Algorithm For Residue Number Systems
We propose in this paper a new algorithm and architecture for performing divisions in residue number systems. Our algorithm is suitable for residue number systems with large modul...
Jean-Claude Bajard, Laurent-Stéphane Didier...
ICPP
2008
IEEE
14 years 1 months ago
On the Design of Fast Pseudo-Random Number Generators for the Cell Broadband Engine and an Application to Risk Analysis
Numerical simulations in computational physics, biology, and finance, often require the use of high quality and efficient parallel random number generators. We design and optimi...
David A. Bader, Aparna Chandramowlishwaran, Virat ...