3223 search results - page 224 / 645 » The Scaling of Search Cost |
155
click to vote
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
— A recent trend for data-intensive computations is to use pay-as-you-go execution environments that scale transparently to the user. However, providers of such environments must...
149
click to vote
EXPERT
2008
15 years 6 months ago
2008
One of the great benefits that Semantic Web (SW) technology offers is facilitating large scale integration and sharing of distributed data sources. Transferring this technology fro...
167
click to vote
CJ
2002
15 years 6 months ago
2002
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
207
click to vote
AAAI
2011
14 years 6 months ago
2011
In this paper, we propose a variant of the conservativeupdate Count-Min sketch to further reduce the overestimation error incurred. Inspired by ideas from lossy counting, we divid...
155
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these...