Sciweavers

2745 search results - page 266 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
16 years 5 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
CVPR
2007
IEEE
15 years 11 months ago
Hierarchical Structuring of Data on Manifolds
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...
Jun Li, Pengwei Hao
TJS
2002
118views more  TJS 2002»
15 years 4 months ago
The MAGNeT Toolkit: Design, Implementation and Evaluation
Abstract-The current trend in constructing high-performance computing systems is to connect a large number of machines via a fast interconnect or a large-scale network such as the ...
Wu-chun Feng, Mark K. Gardner, Jeffrey R. Hay
ICPR
2006
IEEE
16 years 6 months ago
Real-Time Camera Tracking Using Known 3D Models and a Particle Filter
We present an algorithm which can track the 3D pose of a hand held camera in real-time using predefined models of objects in the scene. The technique utilises and extends recently...
Mark Pupilli, Andrew Calway
DAC
2003
ACM
16 years 5 months ago
Improved global routing through congestion estimation
In this paper, we present a new method to improve global routing results. By using an amplified congestion estimate to influence a rip-up and reroute approach, we obtain substanti...
Raia Hadsell, Patrick H. Madden