298 search results - page 26 / 60 » Minimizing Flow Time in the Wireless Gathering Problem |
PERCOM
2010
ACM
13 years 5 months ago
2010
ACM
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...
MASCOTS
2007
13 years 8 months ago
2007
Abstract— Wireless Mesh Networks are a scalable and costeffective solution for next-generation wireless networking. In the present work, we consider the Round Weighting Problem (...
ACCV
2010
Springer
13 years 2 months ago
2010
Springer
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
MP
2007
13 years 6 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
242
click to vote
Presentation
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...