Sciweavers

778 search results - page 65 / 156
» Bounding Smooth Integers
Sort
View
SODA
2000
ACM
121views Algorithms» more  SODA 2000»
13 years 9 months ago
Coloring powers of planar graphs
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
Geir Agnarsson, Magnús M. Halldórsso...
CORR
2011
Springer
180views Education» more  CORR 2011»
13 years 2 months ago
A Formalization of Polytime Functions
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
Sylvain Heraud, David Nowak
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
13 years 9 months ago
Interpolation search for non-independent data
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search. Specifically, define to be the ratio of distance...
Erik D. Demaine, Thouis R. Jones, Mihai Patrascu
ECCV
2008
Springer
14 years 9 months ago
Finding Actions Using Shape Flows
Abstract. We propose a novel method for action detection based on a new action descriptor called a shape flow that represents both the shape and movement of an object in a holistic...
Hao Jiang, David R. Martin
JMIV
1998
130views more  JMIV 1998»
13 years 7 months ago
Topological Numbers and Singularities in Scalar Images: Scale-Space Evolution Properties
Singular points of scalar images in any dimensions are classified by a topological number. This number takes integer values and can efficiently be computed as a surface integral ...
Stiliyan Kalitzin, Bart M. ter Haar Romeny, Alfons...