Sciweavers

1486 search results - page 127 / 298
» Algorithms for two-box covering
Sort
View
SODA
2004
ACM
80views Algorithms» more  SODA 2004»
15 years 5 months ago
Output-sensitive construction of the union of triangles
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...
Eti Ezra, Micha Sharir
ISBI
2002
IEEE
16 years 4 months ago
Covariance-driven retinal image registration initialized from small sets of landmark correspondences
An automatic retinal image registration algorithm would be an important tool for detecting visible changes in the retina caused by the progress of a disease or by the impact of a ...
Chia-Ling Tsai, Charles V. Stewart, Badrinath Roys...
ICSE
2005
IEEE-ACM
16 years 4 months ago
A framework of greedy methods for constructing interaction test suites
Greedy algorithms for the construction of software interaction test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one ...
Charles J. Colbourn, Myra B. Cohen, Renée C...
CAV
2001
Springer
121views Hardware» more  CAV 2001»
15 years 8 months ago
A Practical Approach to Coverage in Model Checking
In formal verification, we verify that a system is correct with respect to a specification. When verification succeeds and the system is proven to be correct, there is still a q...
Hana Chockler, Orna Kupferman, Robert P. Kurshan, ...
WSCG
2004
156views more  WSCG 2004»
15 years 5 months ago
Efficient Collision Detection between 2D Polygons
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
Juan José Jiménez, Rafael Jesú...