10997 search results - page 129 / 2200 » On the Structure of Complete Sets |
229
click to vote
CORR
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
173
click to vote
TPDS
1998
15 years 5 months ago
1998
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...
133
click to vote
AAAI
2008
15 years 8 months ago
2008
We introduce in this paper two new, complete propositional languages and study their properties in terms of (1) their support for polytime operations and (2) their ability to repr...
144
click to vote
EUSFLAT
2007
15 years 7 months ago
2007
We investigate interpretations ψ D of formulas ψ in a first order fuzzy logic in models D which are based on Ω-sets, i.e. sets with similarity relations with values in a comp...
191
click to vote
IPOM
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. Flow-based intrusion detection has recently become a promising security mechanism in high speed networks (1-10 Gbps). Despite the richness in contributions in this field...