#### Filter Results:

#### Publication Year

2005

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Gahyun Park, Wojciech Szpankowski
- 2005

For a given matrix of size n × m over a finite alphabet A, a bicluster is a submatrix composed of selected columns and rows satisfying a certain property. In microarrays analysis one searches for largest biclusters in which selected rows constitute the same string (pattern); in another formulation of the problem one tries to find a maximally dense… (More)

—A Bloom filter is a succinct data structure for membership queries. While the filter enables a compact storage, it allows false positives when queried and exhibits an inherent tradeoff between the false positive rate and space complexity. Among many applications, IP address lookup shows promise for improvement using on-chip Bloom filters; however, high… (More)

This paper investigates a general version of the multiple choice model called the (k, d)-choice process in which n balls are assigned to n bins. In the process, $$k<d$$ k < d balls are placed into the k least loaded out of d bins chosen independently and uniformly at random in each of $$\frac{n}{k}$$ n k rounds. The primary goal is to derive tight bounds on… (More)

- Gahyun Park
- PODC
- 2011

In the multiple choice balls into bins problem, each ball is placed into the least loaded one out of <i>d</i> bins chosen independently and uniformly at random (<i>i.u.r.}</i>). It is known that the maximum load after <i>n</i> balls are placed into <i>n</i> bins is ln ln <i>n</i>/ln <i>d</i> + <i>O</i>(1).
In this paper, we consider a variation of the… (More)

—In structured peer-to-peer (p2p) systems, distributed hash tables (DHTs) often partition the ID space into disjoint intervals with each interval assigned to the corresponding node. While nodes join and leave dynamically, one of the hard challenges posed by DHTs is load balancing across the ID space. Tries are known to be a viable data structure such that a… (More)

- ‹
- 1
- ›