144
click to vote
APPROX
2006
Springer
15 years 9 months ago
2006
Springer
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
166
click to vote
CASES
2004
ACM
15 years 9 months ago
2004
ACM
The tremendous growth of system memories has increased the capacities and capabilities of memory-resident embedded databases, yet current embedded databases need to be tuned in or...
170
click to vote
APPROX
2006
Springer
15 years 9 months ago
2006
Springer
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
157
click to vote
CASES
2004
ACM
15 years 9 months ago
2004
ACM
With the ever-increasing pervasiveness of the Internet and its stringent performance requirements, network system designers have begun utilizing specialized chips to increase the ...