15254 search results - page 309 / 3051 » A k |
209
click to vote
WIDM
2009
ACM
16 years 1 months ago
2009
ACM
As the volume of multimedia data available on internet is tremendously increasing, the content-based similarity search becomes a popular approach to multimedia retrieval. The most...
186
Voted
FLAIRS
2008
15 years 9 months ago
2008
The standard kNN algorithm suffers from two major drawbacks: sensitivity to the parameter value k, i.e., the number of neighbors, and the use of k as a global constant that is ind...
151
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
174
click to vote
EUROCRYPT
2007
Springer
16 years 28 days ago
2007
Springer
A (k, )-robust combiner for collision-resistant hash-functions is a construction which from hash-functions constructs a hash-function which is collision-resistant if at least k of ...
142
click to vote
MFCS
1993
Springer
15 years 11 months ago
1993
Springer
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...