1301 search results - page 83 / 261 » Bounded Version Vectors |
115
Voted
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
139
Voted
ILP
2007
Springer
15 years 9 months ago
2007
Springer
: This paper is concerned with relational Support Vector Machines, at the intersection of Support Vector Machines (SVM) and relational learning or Inductive Logic Programming (ILP)...
114
Voted
ISMIS
2003
Springer
15 years 8 months ago
2003
Springer
We propose an intelligent document title classification agent based on a theory of information inference. The information is represented as vectorial spaces computed by a cognitive...
167
Voted
ICALP
1994
Springer
15 years 7 months ago
1994
Springer
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
141
Voted
SIROCCO
1997
15 years 5 months ago
1997
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual “probabilistic construction”. Also, the best k...