4539 search results - page 389 / 908 » Approaches to Compute Workflow Complexity |
194
click to vote
DEBS
2008
ACM
15 years 8 months ago
2008
ACM
We propose a sensornet programming model based on declarative spatio-temporal constraints on events only, not sensors. Where previous approaches conflate events and sensors becaus...
217
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
The eikonal equation and variants of it are of significant interest for problems in computer vision and image processing. It is the basis for continuous versions of mathematical m...
216
Voted
ICCV
1998
IEEE
16 years 8 months ago
1998
IEEE
A new cascade basis reduction method of computing the optimal least-squares set of basis functions to steer a given function locally is presented. The method combines the Lie grou...
179
click to vote
ICVS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Nearest Neighbor Search (NNS) is employed by many computer vision algorithms. The computational complexity is large and constitutes a challenge for real-time capability. ...
200
click to vote
WSCG
2003
15 years 8 months ago
2003
The computation of global illumination in a dynamic scene constitutes a real challenge in computer graphics. In radiosity algorithms, this problem is far from being easy, especial...