5606 search results - page 607 / 1122 » Randomization Techniques for Graphs. |
164
click to vote
ICHIT
2009
Springer
16 years 1 months ago
2009
Springer
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...
146
click to vote
KI
2009
Springer
16 years 1 months ago
2009
Springer
This paper presents a sequential state estimation method with arbitrary probabilistic models expressing the system’s belief. Probabilistic models can be estimated by Maximum a po...
180
click to vote
SCALESPACE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we suggest an algorithm to recover an image whose wavelet coefficients are partially lost. We propose a wavelet inpainting model by using L0-norm and the t...
171
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
We address the problem of scalable distributed reasoning, proposing a technique for materialising the closure of an RDF graph based on MapReduce. We have implemented our approach o...
203
click to vote
ADAEUROPE
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. The control flow graph is the basis for many code optimisation and analysis techniques. We introduce a new framework for the construction of powerful CFG-based represent...