5606 search results - page 491 / 1122 » Randomization Techniques for Graphs. |
216
click to vote
TON
2012
13 years 9 months ago
2012
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
201
click to vote
ECEASST
2006
15 years 6 months ago
2006
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
203
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-...
130
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
Current compilers lack precise timing models guiding their built-in optimizations. Hence, compilers apply ad-hoc heuristics during optimization to improve code quality. One of the...
194
click to vote
ICDM
2007
IEEE
16 years 1 months ago
2007
IEEE
Statistical topic models such as the Latent Dirichlet Allocation (LDA) have emerged as an attractive framework to model, visualize and summarize large document collections in a co...