Sciweavers

625 search results - page 105 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
ICC
2007
IEEE
176views Communications» more  ICC 2007»
15 years 8 months ago
An Interference-Aware Channel Assignment Scheme for Wireless Mesh Networks
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
Arunabha Sen, Sudheendra Murthy, Samrat Ganguly, S...
118
Voted
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
15 years 5 months ago
Capacitated Confluent Flows: Complexity and Algorithms
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
Daniel Dressler and Martin Strehler
ICRA
2006
IEEE
217views Robotics» more  ICRA 2006»
15 years 8 months ago
Complete Coverage Control for Nonholonomic Mobile Robots in Dynamic Environments
— We study the problem of generating continuous steering control for robots to completely cover a bounded region over a finite time. First, we pack the area by disks of minimum ...
Yi Guo, Mohanakrishnan Balakrishnan
ISM
2005
IEEE
91views Multimedia» more  ISM 2005»
15 years 7 months ago
Research on the Discrimination of Pornographic and Bikini Images
Our research extends the general technologies detecting pornographic images to prevent the benign images whose content is approximate with the pornographic ones from being screene...
Yushi Wang, Weiqiang Wang, Wen Gao
SPAA
2006
ACM
15 years 7 months ago
Network design with weighted players
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
Ho-Lin Chen, Tim Roughgarden