Sciweavers

1963 search results - page 360 / 393
» The Maximum Solution Problem on Graphs
Sort
View
SIGECOM
2009
ACM
91views ECommerce» more  SIGECOM 2009»
14 years 4 months ago
Destroy to save
We study the problem of how to allocate m identical items among n > m agents, assuming each agent desires exactly one item and has a private value for consuming the item. We as...
Geoffroy de Clippel, Victor Naroditskiy, Amy R. Gr...
CN
2008
140views more  CN 2008»
13 years 10 months ago
Congestion control in utility fair networks
This paper deals with a congestion control framework for elastic and real-time traffic, where the user's application is associated with a utility function. We allow users to ...
Tobias Harks, Tobias Poschwatta
CVPR
2009
IEEE
14 years 8 months ago
Markov Chain Monte Carlo Combined with Deterministic Methods for Markov Random Field Optimization
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
Wonsik Kim (Seoul National University), Kyoung Mu ...
MOBIHOC
2006
ACM
14 years 9 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...
TMC
2008
127views more  TMC 2008»
13 years 9 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik