Sciweavers

459 search results - page 5 / 92
» Random sampling from a search engine's index
Sort
View
IJCAI
2003
13 years 8 months ago
Sampling Combinatorial Spaces Using Biased Random Walks
For probabilistic reasoning, one often needs to sample from a combinatorial space. For example, one may need to sample uniformly from the space of all satisfying assignments. Can ...
Jordan Erenrich, Bart Selman
ERCIMDL
1999
Springer
117views Education» more  ERCIMDL 1999»
13 years 11 months ago
Predicting Indexer Performance in a Distributed Digital Library
Resource discovery in a distributed digital library poses many challenges, one of which is how to choose search engines for query distribution, given a query and a set of search e...
Naomi Dushay, James C. French, Carl Lagoze
ICWSM
2009
13 years 5 months ago
Emotionality in Text as Predictor of Behavior
The present study demonstrates how the emotional content of search terms and their eventual results affects the breadth of a users' search for information. We observed the qu...
Elliot Onn, Carey K. Morewedge
DSS
2008
121views more  DSS 2008»
13 years 7 months ago
SpidersRUs: Creating specialized search engines in multiple languages
While small-scale search engines in specific domains and languages are increasingly used by Web users, most existing search engine development tools do not support the development...
Michael Chau, Jialun Qin, Yilu Zhou, Chunju Tseng,...
ICDE
2010
IEEE
183views Database» more  ICDE 2010»
14 years 2 months ago
Estimating the compression fraction of an index using sampling
—Data compression techniques such as null suppression and dictionary compression are commonly used in today’s database systems. In order to effectively leverage compression, it...
Stratos Idreos, Raghav Kaushik, Vivek R. Narasayya...