Sciweavers

2745 search results - page 467 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
WSNA
2003
ACM
15 years 9 months ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li
ISTCS
1992
Springer
15 years 8 months ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit
ICDCN
2011
Springer
14 years 8 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
ECCV
2006
Springer
16 years 6 months ago
Detecting Instances of Shape Classes That Exhibit Variable Structure
This paper proposes a method for detecting instances of shape classes that exhibit variable structure. The term "variable structure" is used to characterize shape classes...
Vassilis Athitsos, Jingbin Wang, Stan Sclaroff, Ma...
MM
2005
ACM
103views Multimedia» more  MM 2005»
15 years 10 months ago
IrisNet: an internet-scale architecture for multimedia sensors
Most current sensor network research explores the use of extremely simple sensors on small devices called motes and focuses on overcoming the resource constraints of these devices...
Jason Campbell, Phillip B. Gibbons, Suman Nath, Pa...