Sciweavers

1333 search results - page 143 / 267
» Not a Number of Floating Point Problems
Sort
View
TIP
2010
147views more  TIP 2010»
14 years 10 months ago
Deform PF-MT: Particle Filter With Mode Tracker for Tracking Nonaffine Contour Deformations
We propose algorithms for tracking the boundary contour of a deforming object from an image sequence, when the nonaffine (local) deformation over consecutive frames is large and th...
Namrata Vaswani, Yogesh Rathi, Anthony J. Yezzi, A...
172
Voted
CASES
2004
ACM
15 years 9 months ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
IJES
2006
110views more  IJES 2006»
15 years 4 months ago
Partitioning bin-packing algorithms for distributed real-time systems
Embedded real-time systems must satisfy not only logical functional requirements but also para-functional properties such as timeliness, Quality of Service (QoS) and reliability. W...
Dionisio de Niz, Raj Rajkumar
SIBGRAPI
2008
IEEE
15 years 10 months ago
Tradeoffs in Approximate Range Searching Made Simpler
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
COMPGEOM
2010
ACM
15 years 9 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...