Sciweavers

2745 search results - page 121 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
155
Voted
ISCAPDCS
2003
15 years 5 months ago
Design and Analysis of Improved Shortest Path Tree Update for Network Routing
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
Bin Xiao, Qingfeng Zhuge, Zili Shao, Edwin Hsing-M...
91
Voted
CVPR
2006
IEEE
16 years 5 months ago
Affine Invariance Revisited
This paper proposes a Riemannian geometric framework to compute averages and distributions of point configurations so that different configurations up to affine transformations ar...
Evgeni Begelfor, Michael Werman
188
Voted
BTW
2009
Springer
240views Database» more  BTW 2009»
15 years 4 months ago
Efficient Adaptive Retrieval and Mining in Large Multimedia Databases
Abstract: Multimedia databases are increasingly common in science, business, entertainment and many other applications. Their size and high dimensionality of features are major cha...
Ira Assent
ICDCS
2007
IEEE
15 years 10 months ago
A High Throughput Atomic Storage Algorithm
This paper presents an algorithm to ensure the atomicity of a distributed storage that can be read and written by any number of clients. In failure-free and synchronous situations...
Rachid Guerraoui, Dejan Kostic, Ron R. Levy, Vivie...
147
Voted
VIS
2004
IEEE
227views Visualization» more  VIS 2004»
16 years 5 months ago
Intuitive and Interactive Modification of Large Finite Element Models
Virtual prototyping is increasingly replacing real mock-ups and experiments in industrial product development. Part of this process is the simulation of structural and functional ...
Dirc Rose, Katrin Bidmon, Thomas Ertl