432 search results - page 67 / 87 » Internally deterministic parallel algorithms can be fast |
104
click to vote
DAGM
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. A successful approach to tracking is to on-line learn discriminative classifiers for the target objects. Although these trackingby-detection approaches are usually fast a...
IROS
2007
IEEE
15 years 3 months ago
2007
IEEE
— Due to their panoramic field of view, catadioptric cameras are becoming ubiquitous in many robotics and computer vision applications. Catadioptric cameras with a unique viewpo...
RTAS
2005
IEEE
15 years 3 months ago
2005
IEEE
Networking applications, such as VPN and content filtering, demand extra computing power in order to meet the throughput requirement nowadays. In addition to pure ASIC solutions, ...
SIGGRAPH
1994
ACM
15 years 1 months ago
1994
ACM
FBRAM, a new form of dynamic random access memory that greatly accelerates the rendering of Z-buffered primitives, is presented. Two key concepts make this acceleration possible. ...
ICCD
2002
IEEE
15 years 6 months ago
2002
IEEE
Subword parallelism has succeeded in accelerating many multimedia applications. Subword permutation instructions have been proposed to efficiently rearrange subwords in or among r...