Sciweavers

1539 search results - page 62 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
ICPR
2002
IEEE
16 years 3 months ago
Fast Hierarchical Clustering Based on Compressed Data
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Erendira Rendon, Ricardo Barandela
116
Voted
ICIP
1999
IEEE
16 years 4 months ago
A Fast Image Registration Technique for Motion Artifact Reduction in DSA
In digital subtraction angiography (DSA), patient motion is the primary cause of image quality degradation. The motion correction algorithms developed so far were not sufficiently...
Erik H. W. Meijering, Karel J. Zuiderveld, Wiro J....
ECCV
2002
Springer
16 years 4 months ago
Structure and Motion for Dynamic Scenes - The Case of Points Moving in Planes
We consider dynamic scenes consisting of moving points whose motion is constrained to happen in one of a pencil of planes. This is for example the case when rigid objects move ind...
Peter F. Sturm
COMPGEOM
2000
ACM
15 years 6 months ago
Algebraic methods and arithmetic filtering for exact predicates on circle arcs
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparis...
Olivier Devillers, Alexandra Fronville, Bernard Mo...
249
Voted
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 2 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup