Sciweavers

1142 search results - page 211 / 229
» Approximability of Clausal Constraints
Sort
View
STOC
2009
ACM
150views Algorithms» more  STOC 2009»
16 years 2 months ago
Integrality gaps for Sherali-Adams relaxations
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
Moses Charikar, Konstantin Makarychev, Yury Makary...
KDD
2009
ACM
221views Data Mining» more  KDD 2009»
16 years 2 months ago
Migration motif: a spatial - temporal pattern mining approach for financial markets
A recent study by two prominent finance researchers, Fama and French, introduces a new framework for studying risk vs. return: the migration of stocks across size-value portfolio ...
Xiaoxi Du, Ruoming Jin, Liang Ding, Victor E. Lee,...
134
Voted
MOBIHOC
2008
ACM
16 years 1 months ago
Strong barrier coverage of wireless sensor networks
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
Benyuan Liu, Olivier Dousse, Jie Wang, Anwar Saipu...
EUROGRAPHICS
2010
Eurographics
15 years 11 months ago
Adding Depth to Cartoons Using Sparse Depth (In)equalities
This paper presents a novel interactive approach for adding depth information into hand-drawn cartoon images and animations. In comparison to previous depth assignment techniques ...
Daniel Sýkora, David Sedlacek, Sun Jinchao, John ...
CVPR
2010
IEEE
15 years 10 months ago
Recovering Fluid-type Motions Using Navier-Stokes Potential Flow
The classical optical flow assumes that a feature point maintains constant brightness across the frames. For fluidtype motions such as smoke or clouds, the constant brightness ass...
Feng Li, Liwei Xu, Philippe Guyenne, Jingyi Yu