6365 search results - page 244 / 1273 » Fast Local Computation Algorithms |
203
click to vote
JGTOOLS
2006
15 years 6 months ago
2006
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
177
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
The goal of this work is to find a fast method for motion estimation and motion segmentation. We chose to decompose the motion on a basis functions. That allows us to compute the ...
202
click to vote
ICDCS
2010
IEEE
15 years 10 months ago
2010
IEEE
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
165
click to vote
ANCS
2006
ACM
16 years 15 days ago
2006
ACM
The fast spreading worm is becoming one of the most serious threats to today’s networked information systems. A fast spreading worm could infect hundreds of thousands of hosts w...
167
click to vote
SI3D
2009
ACM
16 years 1 months ago
2009
ACM
Lines drawn over or in place of shaded 3D models can often provide greater comprehensibility and stylistic freedom that shading alone. A substantial challenge for making stylized ...