Sciweavers

1830 search results - page 227 / 366
» Workshop on Graph Computation Models
Sort
View
PAAPP
2000
118views more  PAAPP 2000»
15 years 6 months ago
Processor-time-optimal systolic arrays
Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic gra...
Peter R. Cappello, Ömer Egecioglu, Chris J. S...
ICPR
2008
IEEE
16 years 21 days ago
A robust front page detection algorithm for large periodical collections
Large-scale digitization projects aimed at periodicals often have as input streams of completely unlabeled document images. In such situations, the results produced by the automat...
Iuliu Vasile Konya, Christoph Seibert, Sebastian G...
SI3D
2003
ACM
15 years 11 months ago
Interactive navigation in complex environments using path planning
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
Brian Salomon, Maxim Garber, Ming C. Lin, Dinesh M...
CVPR
2011
IEEE
15 years 2 months ago
Cross-View Action Recognition via View Knowledge Transfer
In this paper, we present a novel approach to recognizing human actions from different views by view knowledge transfer. An action is originally modelled as a bag of visual-words ...
Jingen Liu
IPPS
2009
IEEE
16 years 28 days ago
Deadlock prevention by turn prohibition in interconnection networks
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa