Sciweavers

118 search results - page 10 / 24
» An Iterative Algorithm for Synthesizing Invariants
Sort
View
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 2 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
PAMI
2007
122views more  PAMI 2007»
13 years 7 months ago
Three-Dimensional Surface Mesh Segmentation Using Curvedness-Based Region Growing Approach
—A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspon...
Anupama Jagannathan, Eric L. Miller
VTC
2008
IEEE
105views Communications» more  VTC 2008»
14 years 1 months ago
Practical Results of High Resolution AOA Estimation by the Synthetic Array
— In this paper, a new method for AOA estimation, based on the synthetic ESPRIT algorithm is described and tested with actual CDMA signals. Physical size constraints of handheld ...
Ali Broumandan, John Nielsen, Gérard Lachap...
IJCV
2000
110views more  IJCV 2000»
13 years 7 months ago
A Parametric Texture Model Based on Joint Statistics of Complex Wavelet Coefficients
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed ...
Javier Portilla, Eero P. Simoncelli
PLDI
2010
ACM
14 years 5 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger