Sciweavers

197 search results - page 37 / 40
» Simple deterministic approximation algorithms for counting m...
Sort
View
EMMCVPR
2005
Springer
14 years 1 months ago
Stereo for Slanted Surfaces: First Order Disparities and Normal Consistency
Traditional stereo algorithms either explicitly use the frontal parallel plane assumption by only considering position (zero-order) disparity when computing similarity measures of ...
Gang Li, Steven W. Zucker
MFCS
2010
Springer
13 years 6 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 8 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
CAD
2005
Springer
13 years 7 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
KDD
2012
ACM
222views Data Mining» more  KDD 2012»
11 years 10 months ago
Rise and fall patterns of information diffusion: model and implications
The recent explosion in the adoption of search engines and new media such as blogs and Twitter have facilitated faster propagation of news and rumors. How quickly does a piece of ...
Yasuko Matsubara, Yasushi Sakurai, B. Aditya Praka...