Sciweavers

1984 search results - page 258 / 397
» The colourful feasibility problem
Sort
View
INFOCOM
2011
IEEE
14 years 10 months ago
Consort: Node-Constrained Opportunistic Routing in wireless mesh networks
— Opportunistic routing is proposed to improve the performance of wireless networks by exploiting the broadcast nature and spatial diversity of the wireless medium. In this paper...
Xi Fang, Dejun Yang, Guoliang Xue
PDP
2011
IEEE
14 years 10 months ago
Transport Optimization in Peer-to-Peer Networks
Abstract—The peer-to-peer networking concept has revolutionized the cost structure of Internet data dissemination by making large scale content delivery with low server cost feas...
Konstantin Miller, Adam Wolisz
ALGORITHMICA
2011
14 years 10 months ago
Average Rate Speed Scaling
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dual-objective scheduling problems, where the operati...
Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk...
CVIU
2011
14 years 10 months ago
Polynomial algorithms for subisomorphism of nD open combinatorial maps
Combinatorial maps describe the subdivision of objects in cells, and incidence and adjacency relations between cells, and they are widely used to model 2D and 3D images. However, ...
Guillaume Damiand, Christine Solnon, Colin de la H...
3DIM
2011
IEEE
14 years 6 months ago
6DoF Registration of 2D Laser Scans
—We address the problem of registering a set of 2D laser scans in 3D space with regard to six degrees of freedom. Registering single 2D scans is only possible when making strong ...
Benjamin Huhle, Timo Schairer, Andreas Schilling, ...