Sciweavers

4744 search results - page 304 / 949
» Connected Computing
Sort
View
ICDCS
2008
IEEE
15 years 11 months ago
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
Peng-Jun Wan, Lixin Wang, F. Frances Yao
ICN
2001
Springer
15 years 9 months ago
Optimal Provisioning and Pricing of Internet Differentiated Services in Hierarchical Markets
Abstract— Network service providers contract with network owners for connection rights, then offer individual users network access at a price. Within this hierarchy, the service ...
Errin W. Fulp, Douglas S. Reeves
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 5 months ago
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
David Liben-Nowell
SOSP
1997
ACM
15 years 5 months ago
Distributed Schedule Management in the Tiger Video Fileserver
Tiger is a scalable, fault-tolerant video file server constructed from a collection of computers connected by a switched network. All content files are striped across all of the c...
William J. Bolosky, Robert P. Fitzgerald, John R. ...
EMMCVPR
2001
Springer
15 years 9 months ago
Multiple Contour Finding and Perceptual Grouping as a Set of Energy Minimizing Paths
We address the problem of finding a set of contour curves in an image. We consider the problem of perceptual grouping and contour completion, where the data is a set of points in ...
Laurent D. Cohen, Thomas Deschamps