Sciweavers

828 search results - page 60 / 166
» Simplicial Powers of Graphs
Sort
View
EGH
2009
Springer
13 years 6 months ago
Fast minimum spanning tree for large graphs on the GPU
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
Vibhav Vineet, Pawan Harish, Suryakant Patidar, P....
PAMI
2011
13 years 3 months ago
Dynamic Programming and Graph Algorithms in Computer Vision
Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization ...
Pedro F. Felzenszwalb, Ramin Zabih
DATE
2007
IEEE
167views Hardware» more  DATE 2007»
14 years 3 months ago
A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multip
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
Nadathur Satish, Kaushik Ravindran, Kurt Keutzer
ACSC
2004
IEEE
14 years 14 days ago
Network Robustness and Graph Topology
Two important recent trends in military and civilian communications have been the increasing tendency to base operations around an internal network, and the increasing threats to ...
Anthony H. Dekker, Bernard D. Colbert
SAC
2006
ACM
14 years 2 months ago
Evaluating unstructured peer-to-peer lookup overlays
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
Idit Keidar, Roie Melamed