Sciweavers

308 search results - page 62 / 62
» How Fast Is the k-Means Method
Sort
View
IBPRIA
2009
Springer
13 years 10 months ago
Large Scale Online Learning of Image Similarity through Ranking
ent abstract presents OASIS, an Online Algorithm for Scalable Image Similarity learning that learns a bilinear similarity measure over sparse representations. OASIS is an online du...
Gal Chechik, Varun Sharma, Uri Shalit, Samy Bengio
IANDC
2010
84views more  IANDC 2010»
13 years 3 months ago
Underapproximation for model-checking based on universal circuits
For two naturals m, n such that m < n, we show how to construct a circuit C with m inputs and n outputs, that has the following property: for some 0 ≤ k ≤ m, the circuit deï...
Arie Matsliah, Ofer Strichman
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
14 years 5 months ago
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul...