3708 search results - page 168 / 742 » Approximating Betweenness Centrality |
136
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
182
click to vote
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
Reinforcement learning has been used for training game playing agents. The value function for a complex game must be approximated with a continuous function because the number of ...
164
click to vote
RTA
2010
Springer
15 years 9 months ago
2010
Springer
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...
168
Voted
RECOMB
2000
Springer
15 years 8 months ago
2000
Springer
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...
130
click to vote
ICCAD
1995
IEEE
15 years 8 months ago
1995
IEEE
This paper presents a linear time algorithm to reduce a large RC interconnect network into subnetworks which are approximated with lower order equivalent RC circuits. The number o...