Sciweavers

107 search results - page 19 / 22
» Random sampling and approximation of MAX-CSP problems
Sort
View
MST
2010
93views more  MST 2010»
14 years 8 months ago
Atomic Congestion Games: Fast, Myopic and Concurrent
We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
92
Voted
ECCV
2008
Springer
15 years 11 months ago
Compressive Sensing for Background Subtraction
Abstract. Compressive sensing (CS) is an emerging field that provides a framework for image recovery using sub-Nyquist sampling rates. The CS theory shows that a signal can be reco...
Volkan Cevher, Aswin C. Sankaranarayanan, Marco F....
TKDE
2012
199views Formal Methods» more  TKDE 2012»
13 years 2 days ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang
CVPR
2005
IEEE
14 years 11 months ago
Dense Photometric Stereo Using Tensorial Belief Propagation
We address the normal reconstruction problem by photometric stereo using a uniform and dense set of photometric images captured at fixed viewpoint. Our method is robust to spurio...
Kam-Lun Tang, Chi-Keung Tang, Tien-Tsin Wong
168
Voted
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
15 years 11 months ago
Proof Sketches: Verifiable In-Network Aggregation
Recent work on distributed, in-network aggregation assumes a benign population of participants. Unfortunately, modern distributed systems are plagued by malicious participants. In...
Minos N. Garofalakis, Joseph M. Hellerstein, Petro...