Sciweavers

2304 search results - page 205 / 461
» On the Vulnerability of Large Graphs
Sort
View
HIPEAC
2009
Springer
15 years 10 months ago
HeDGE: Hybrid Dataflow Graph Execution in the Issue Logic
Abstract. Exposing more instruction-level parallelism in out-of-order superscalar processors requires increasing the number of dynamic in-flight instructions. However, large instru...
Suriya Subramanian, Kathryn S. McKinley
ECCV
2008
Springer
15 years 8 months ago
Multiple Instance Boost Using Graph Embedding Based Decision Stump for Pedestrian Detection
Pedestrian detection in still image should handle the large appearance and stance variations arising from the articulated structure, various clothing of human as well as viewpoints...
Junbiao Pang, Qingming Huang, Shuqiang Jiang
CCCG
2010
15 years 8 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
APBC
2003
141views Bioinformatics» more  APBC 2003»
15 years 8 months ago
Comparison of Metabolic Pathways using Constraint Graph Drawing
Databases contain a large amount of data about metabolic pathways, in particular about similar pathways in different species. Biologists are familiar with visual representations ...
Falk Schreiber
DAGSTUHL
2003
15 years 8 months ago
Feature tracking with skeleton graphs
One way to visualize large time-dependent data sets, is by visualization of the evolution of features in these data. The process consists of four steps: feature extraction, featur...
Benjamin Vrolijk, Freek Reinders, Frits H. Post