Sciweavers

529 search results - page 56 / 106
» Improving verbose queries using subset distribution
Sort
View
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
13 years 11 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
14 years 9 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...
WWW
2005
ACM
14 years 8 months ago
Automatic identification of user goals in Web search
There have been recent interests in studying the "goal" behind a user's Web query, so that this goal can be used to improve the quality of a search engine's re...
Uichin Lee, Zhenyu Liu, Junghoo Cho
ICDCS
1999
IEEE
14 years 5 days ago
Interpreting Stale Load Information
In this paper we examine the problem of balancing load in a large-scale distributed system when information about server loads may be stale. It is well known that sending each req...
Michael Dahlin
TKDE
2010
218views more  TKDE 2010»
13 years 2 months ago
LIGHT: A Query-Efficient Yet Low-Maintenance Indexing Scheme over DHTs
DHT is a widely used building block for scalable P2P systems. However, as uniform hashing employed in DHTs destroys data locality, it is not a trivial task to support complex queri...
Yuzhe Tang, Shuigeng Zhou, Jianliang Xu