Sciweavers

2229 search results - page 392 / 446
» Comparative analysis of biclustering algorithms
Sort
View
ICML
1999
IEEE
14 years 8 months ago
Distributed Value Functions
Many interesting problems, such as power grids, network switches, and tra c ow, that are candidates for solving with reinforcement learningRL, alsohave properties that make distri...
Jeff G. Schneider, Weng-Keen Wong, Andrew W. Moore...
WWW
2007
ACM
14 years 8 months ago
Determining the user intent of web search engine queries
Determining the user intent of Web searches is a difficult problem due to the sparse data available concerning the searcher. In this paper, we examine a method to determine the us...
Bernard J. Jansen, Danielle L. Booth, Amanda Spink
WWW
2004
ACM
14 years 8 months ago
Mining anchor text for query refinement
When searching large hypertext document collections, it is often possible that there are too many results available for ambiguous queries. Query refinement is an interactive proce...
Reiner Kraft, Jason Y. Zien
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
14 years 8 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
SIGMOD
2007
ACM
167views Database» more  SIGMOD 2007»
14 years 8 months ago
Data currency in replicated DHTs
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez