1002 search results - page 22 / 201 » Towards Graph Programs for Graph Algorithms |
CSL
2008
Springer
15 years 3 months ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
CORR
2006
Springer
15 years 1 months ago
2006
Springer
The program Synarcher for synonym (and related terms) search in the text corpus of special structure (Wikipedia) was developed. The results of the search are presented in the form...
118
click to vote
ISSTA
2006
ACM
15 years 7 months ago
2006
ACM
Regression testing aims at showing that code has not been adversely affected by modification activities during maintenance. Regression test selection techniques reuse tests from...
120
click to vote
GPCE
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Model-driven architecture envisions a paradigm shift as dramatic as the one from low-level assembler languages to high-level programming languages. In order for this visi...
112
click to vote
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...