Sciweavers

4745 search results - page 274 / 949
» Discretization: An Enabling Technique
Sort
View
PAMI
2010
112views more  PAMI 2010»
15 years 5 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
ICIG
2009
IEEE
15 years 4 months ago
Statistical Modeling of Optical Flow
Optical flow estimation is one of the main subjects in computer vision. Many methods developed to compute the motion fields are built using standard heuristic formulation. In this...
Dongmin Ma, Véronique Prinet, Cyril Cassisa
CJ
2010
150views more  CJ 2010»
15 years 4 months ago
Program Analysis Probably Counts
Abstract. Semantics-based program analysis uses an abstract semantics of programs/systems to statically determine run-time properties. Classic examples from compiler technology inc...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
NA
2010
124views more  NA 2010»
15 years 1 months ago
An efficient unified approach for the numerical solution of delay differential equations
In this paper we propose a new framework for designing a delay differential equation (DDE) solver which works with any supplied initial value problem (IVP) solver that is based on...
Hossein ZivariPiran, Wayne H. Enright
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
13 years 9 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák