Sciweavers

1951 search results - page 229 / 391
» An algorithm for improving graph partitions
Sort
View
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 5 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
SCALESPACE
2009
Springer
15 years 11 months ago
L0-Norm and Total Variation for Wavelet Inpainting
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...
Andy C. Yau, Xue-Cheng Tai, Michael K. Ng
130
Voted
ICAS
2006
IEEE
103views Robotics» more  ICAS 2006»
15 years 11 months ago
Model Driven capabilities of the DA-GRS model
— The development of applications that target dynamic networks often adresses the same difficulties. Since the underlying network topology is unstable, the application has to ha...
Arnaud Casteigts
CLEF
2007
Springer
15 years 11 months ago
Multiplying Concept Sources for Graph Modeling
This paper presents the LIG contribution to the CLEF 2007 medical retrieval task (i.e. ImageCLEFmed). The main idea in this paper is to incorporate medical knowledge in the langua...
Loïc Maisonnasse, Éric Gaussier, Jean-...
ILP
2007
Springer
15 years 11 months ago
Structural Statistical Software Testing with Active Learning in a Graph
Structural Statistical Software Testing (SSST) exploits the control flow graph of the program being tested to construct test cases. Specifically, SSST exploits the feasible paths...
Nicolas Baskiotis, Michèle Sebag