Sciweavers

2745 search results - page 421 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
ECCV
2006
Springer
16 years 6 months ago
Triangulation for Points on Lines
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
Adrien Bartoli, Jean-Thierry Lapresté
PODC
2011
ACM
14 years 7 months ago
Robust network supercomputing without centralized control
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
Seda Davtyan, Kishori M. Konwar, Alexander A. Shva...
EUROSYS
2007
ACM
16 years 1 months ago
hFS: a hybrid file system prototype for improving small file and metadata performance
Two oft-cited file systems, the Fast File System (FFS) and the Log-Structured File System (LFS), adopt two sharply different update strategies—update-in-place and update-out-of-...
Zhihui Zhang, Kanad Ghose
IPSN
2007
Springer
15 years 11 months ago
Robust system multiangulation using subspace methods
Sensor location information is a prerequisite to the utility of most sensor networks. In this paper we present a robust and low-complexity algorithm to self-localize and orient se...
Joshua N. Ash, Lee C. Potter
LCN
1994
IEEE
15 years 8 months ago
The Ethernet Capture Effect: Analysis and Solution
We analyze the behavior of the Ethernet in networks with a small number of active stations, and describe what is known as the Ethernet capture effect, where a station transmits co...
K. K. Ramakrishnan, Henry Yang