4539 search results - page 584 / 908 » Approaches to Compute Workflow Complexity |
413
click to vote
DAC
2012
ACM
13 years 9 months ago
2012
ACM
Due to the breakdown of Dennardian scaling, the percentage of a silicon chip that can switch at full frequency is dropping exponentially with each process generation. This utiliza...
204
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
177
click to vote
HICSS
1994
IEEE
15 years 10 months ago
1994
IEEE
Meeting research and especially research on Computer Supported Meetings of natural teams is not available in abundance. What is reported of meetings often uses a rather limited th...
161
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
: Significant progress has been made by the computer vision community in recent years along two fronts: (i) developing complex spatial-temporal models for object registration and t...
183
click to vote
DAGM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Approaches to visual navigation, e.g. used in robotics, require computationally efficient, numerically stable, and robust methods for the estimation of ego-motion. One of...