Sciweavers

36 search results - page 2 / 8
» Ritt-Wu's Decomposition Algorithm and Geometry Theorem Provi...
Sort
View
JCT
2008
109views more  JCT 2008»
13 years 7 months ago
Decomposing Berge graphs and detecting balanced skew partitions
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
Nicolas Trotignon
ICASSP
2008
IEEE
14 years 2 months ago
Some properties of an empirical mode type signal decomposition algorithm
The empirical mode decomposition (EMD) has seen widespread use for analysis of nonlinear and nonstationary time-series. Despite some practical success, it lacks a firm theoretica...
Stephen D. Hawley, Les E. Atlas, Howard J. Chizeck
ICCV
2011
IEEE
12 years 7 months ago
Optimizing Polynomial Solvers for Minimal Geometry Problems
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
Oleg Naroditsky, Kostas Daniilidis
WADS
2009
Springer
237views Algorithms» more  WADS 2009»
14 years 2 months ago
A Pseudopolynomial Algorithm for Alexandrov's Theorem
Alexandrov’s Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of some convex polyhedro...
Daniel M. Kane, Gregory N. Price, Erik D. Demaine
EUC
2005
Springer
14 years 1 months ago
Dependable Polygon-Processing Algorithms for Safety-Critical Embedded Systems
Algorithms that process geometric objects become more and more important for many safety-critical embedded systems, e.g. for motion planning or collision detection, where correctne...
Jens Brandt, Klaus Schneider