167 search results - page 11 / 34 » A New Lower Bound for A(17, 6, 6) |
SISAP
2008
IEEE
14 years 2 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
SIGIR
1992
ACM
14 years 6 hour 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...
NIPS
2008
13 years 9 months ago
2008
Confidence-weighted (CW) learning [6], an online learning method for linear classifiers, maintains a Gaussian distributions over weight vectors, with a covariance matrix that repr...
DM
2007
13 years 8 months ago
2007
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...
SIAMDM
2008
13 years 7 months ago
2008
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...