Sciweavers

455 search results - page 77 / 91
» Approximation Algorithms for Partial Covering Problems
Sort
View
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
15 years 7 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
SOCA
2008
IEEE
14 years 9 months ago
Log-based mining techniques applied to Web service composition reengineering
There is no doubt that SOA and BPM will continue to evolve dependently for the next ten years. Preparing common research infrastructures will require most important efforts of web ...
Walid Gaaloul, Karim Baïna, Claude Godart
ICMCS
2006
IEEE
107views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Rain Removal in Video by Combining Temporal and Chromatic Properties
Removal of rain streaks in video is a challenging problem due to the random spatial distribution and fast motion of rain. This paper presents a new rain removal algorithm that inc...
Xiaopeng Zhang, Hao Li, Yingyi Qi, Wee Kheng Leow,...
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
15 years 7 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
ICC
2007
IEEE
203views Communications» more  ICC 2007»
15 years 4 months ago
Distributed Data Aggregation Using Clustered Slepian-Wolf Coding in Wireless Sensor Networks
—Slepian-Wolf coding is a promising distributed source coding technique that can completely remove the data redundancy caused by the spatially correlated observations in wireless...
Pu Wang, Cheng Li, Jun Zheng