2131 search results - page 167 / 427 » Immunity for Closed Sets |
158
click to vote
SIGIR
1992
ACM
15 years 10 months ago
1992
ACM
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
209
click to vote
EUROCODE
1990
15 years 10 months ago
1990
: This paper deals with the effect of bit change errors on the linear complexity of finite sequences. Though a change in a single bit can cause a large change in linear complexity,...
192
click to vote
VLDB
1990
ACM
15 years 10 months ago
1990
ACM
In several image applications, it is necessary to retrieve specific line segments born a potentially very large set. In this paper, we consider the problem of indexing straight li...
179
click to vote
APPROX
2006
Springer
15 years 10 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...
168
click to vote
AUSDM
2006
Springer
15 years 10 months ago
2006
Springer
The field of Record Linkage is concerned with identifying records from one or more datasets which refer to the same underlying entities. Where entity-unique identifiers are not av...