Sciweavers

4865 search results - page 466 / 973
» The Complexity of Graph Connectivity
Sort
View
SAC
2010
ACM
16 years 1 days ago
An algorithm to generate the context-sensitive synchronized control flow graph
The verification of industrial systems specified with CSP often implies the analysis of many concurrent and synchronized components. The cost associated to these analyses is usu...
Marisa Llorens, Javier Oliver, Josep Silva, Salvad...
APVIS
2006
15 years 8 months ago
Predicting graph reading performance: a cognitive approach
Performance and preference measures are commonly used in the assessment of visualization techniques. This is important and useful in understanding differences in effectiveness bet...
Weidong Huang, Seok-Hee Hong, Peter Eades
ESANN
2001
15 years 8 months ago
Graph extraction from color images
Abstract. An approach to symbolic contour extraction will be described that consists of three stages: enhancement, detection, and extraction of edges and corners. Edges and corners...
Tino Lourens, Kazuhiro Nakadai, Hiroshi G. Okuno, ...
ICASSP
2010
IEEE
15 years 7 months ago
Shape matching based on graph alignment using hidden Markov models
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
Xiaoning Qian, Byung-Jun Yoon
CORR
2007
Springer
135views Education» more  CORR 2007»
15 years 6 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar