Sciweavers

30 search results - page 5 / 6
» jda 2006
Sort
View
JDA
2006
85views more  JDA 2006»
13 years 6 months ago
Average case analysis of DJ graphs
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
Johann Blieberger
JDA
2010
131views more  JDA 2010»
13 years 4 months ago
Convex drawings of hierarchical planar graphs and clustered planar graphs
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
Seok-Hee Hong, Hiroshi Nagamochi
JDA
2010
88views more  JDA 2010»
13 years 4 months ago
Greedy colorings for the binary paintshop problem
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
Hadis Amini, Frédéric Meunier, H&eac...
JDA
2007
73views more  JDA 2007»
13 years 5 months ago
Parameterized matching with mismatches
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
Alberto Apostolico, Péter L. Erdös, Mo...
JDA
2007
135views more  JDA 2007»
13 years 5 months ago
Cache placement in sensor networks under an update cost constraint
In this paper, we address an optimization problem that arises in the context of cache placement in sensor networks. In particular, we consider the cache placement problem where th...
Bin Tang, Himanshu Gupta