ICNP
2009
IEEE
13 years 11 months ago
2009
IEEE
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...
KBSE
2009
IEEE
13 years 11 months ago
2009
IEEE
—Automated debugging is becoming increasingly important as the size and complexity of software increases. This paper makes a case for using constraint-based data structure repair...
WETICE
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract—DHT systems are structured overlay networks capable of using P2P resources as a scalable platform for very large data storage applications. However, their efficiency ex...
WEA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
STOC
2001
ACM
14 years 4 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
ESORICS
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. A range of attacks on network components, such as algorithmic denial-of-service attacks and cryptanalysis via timing attacks, are enabled by data structures for which an ...
ICML
2000
IEEE
14 years 5 months ago
2000
IEEE
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...