2370 search results - page 12 / 474 » The Characterization of Data-Accumulating Algorithms |
DAM
2011
13 years 4 months ago
2011
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...
DGCI
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. We present a new algorithm for modeling and characterizing shape changes in 3D image sequences of biomedical structures. Our algorithm tracks the shape changes of the obj...
COCOON
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...
TIME
2009
IEEE
14 years 4 months ago
2009
IEEE
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...