Sciweavers

14548 search results - page 2854 / 2910
» The Optimal Path-Matching Problem
Sort
View
MM
2006
ACM
189views Multimedia» more  MM 2006»
15 years 8 months ago
Real-time computerized annotation of pictures
Automated annotation of digital pictures has been a highly challenging problem for computer scientists since the invention of computers. The capability of annotating pictures by c...
Jia Li, James Ze Wang
135
Voted
MOBICOM
2006
ACM
15 years 8 months ago
Routing algorithms for delay-insensitive and delay-sensitive applications in underwater sensor networks
Underwater sensor networks consist of sensors and vehicles deployed to perform collaborative monitoring tasks over a given region. Underwater sensor networks will find applicatio...
Dario Pompili, Tommaso Melodia, Ian F. Akyildiz
120
Voted
PEWASUN
2006
ACM
15 years 8 months ago
Experimental analysis of a transport protocol for ad hoc networks (TPA)
Many previous papers have pointed out that TCP performance in multi-hop ad hoc networks is not optimal. This is due to several TCP design principles that reflect the characteristi...
Giuseppe Anastasi, Emilio Ancillotti, Marco Conti,...
112
Voted
PLDI
2006
ACM
15 years 8 months ago
Context-sensitive domain-independent algorithm composition and selection
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...
Troy A. Johnson, Rudolf Eigenmann
155
Voted
PODC
2006
ACM
15 years 8 months ago
Self-stabilizing byzantine agreement
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
Ariel Daliot, Danny Dolev
« Prev « First page 2854 / 2910 Last » Next »