Sciweavers

840 search results - page 135 / 168
» Inapproximability of Combinatorial Optimization Problems
Sort
View
CVPR
2008
IEEE
15 years 29 days ago
Interactive image matting for multiple layers
Image matting deals with finding the probability that each pixel in an image belongs to a user specified `object' or to the remaining `background'. Most existing methods...
Dheeraj Singaraju, René Vidal
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 5 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
ICC
2007
IEEE
119views Communications» more  ICC 2007»
14 years 5 months ago
A Convex Quadratic SDMA Grouping Algorithm Based on Spatial Correlation
Abstract— Space Division Multiple Access (SDMA) is a promising solution to improve the spectral efficiency of future mobile radio systems. However, finding the group of MSs tha...
Tarcisio F. Maciel, Anja Klein
VTC
2006
IEEE
138views Communications» more  VTC 2006»
14 years 5 months ago
Simulated Annealing based Wireless Sensor Network Localization with Flip Ambiguity Mitigation
Abstract— Accurate self-localization capability is highly desirable in wireless sensor networks. A major problem in wireless sensor network localization is the flip ambiguity, w...
Anushiya A. Kannan, Guoqiang Mao, Branka Vucetic
STACS
2001
Springer
14 years 3 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...