Sciweavers

1539 search results - page 135 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 3 months ago
Maintaining deforming surface meshes
We present a method to maintain a mesh approximating a deforming surface, which is specified by a dense set of sample points. We identify a reasonable motion model for which a pro...
Siu-Wing Cheng, Tamal K. Dey
EUROCAST
2005
Springer
86views Hardware» more  EUROCAST 2005»
15 years 8 months ago
Convergence of Iterations
Convergence is a central problem in both computer science and in population biology. Will a program terminate? Will a population go to an equilibrium? In general these questions ar...
Paul Cull
113
Voted
SASO
2007
IEEE
15 years 8 months ago
Desynchronization: The Theory of Self-Organizing Algorithms for Round-Robin Scheduling
The study of synchronization has received much attention in a variety of applications, ranging from coordinating sensors in wireless networks to models of fireflies flashing in...
Ankit Patel, Julius Degesys, Radhika Nagpal
CSDA
2007
102views more  CSDA 2007»
15 years 2 months ago
Smooth functions and local extreme values
Given a sample of n observations y1, . . . , yn at time points t1, . . . , tn we consider the problem of specifying a function ˜f such that ˜f • is smooth, • fits the data ...
A. Kovac
CGI
2006
IEEE
15 years 8 months ago
Improving the Interval Ray Tracing of Implicit Surfaces
This paper presents a fast and reliable method to trim non-solution regions in an interval ray tracing process. The “trimming algorithm” uses interval analysis to perform rejec...
Jorge Flórez, Mateu Sbert, Miguel Án...