Sciweavers

1201 search results - page 187 / 241
» Linear Probing and Graphs
Sort
View
STOC
1998
ACM
167views Algorithms» more  STOC 1998»
15 years 4 months ago
An Improved Approximation Algorithm for Multiway Cut
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
96
Voted
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
15 years 4 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
MFCS
2000
Springer
15 years 4 months ago
Bilinear Functions and Trees over the (max, +) Semiring
Abstract. We consider the iterates of bilinear functions over the semiring (max, +). Equivalently, our object of study can be viewed as recognizable tree series over the semiring (...
Sabrina Mantaci, Vincent D. Blondel, Jean Mairesse
110
Voted
POS
2000
Springer
15 years 4 months ago
The Memory Behavior of the WWW, or The WWW Considered as a Persistent Store
Abstract. This paper presents the performance evaluation of five memory allocation strategies for the PerDiS Persistent Distributed Object store in the context of allocating two di...
Nicolas Richer, Marc Shapiro
IPPS
1995
IEEE
15 years 4 months ago
Performance evaluation of a new parallel preconditioner
The linear systems associated with large, sparse, symmetric, positive definite matrices are often solved iteratively using the preconditioned conjugate gradient method. We have d...
Keith D. Gremban, Gary L. Miller, Marco Zagha