Sciweavers

621 search results - page 68 / 125
» Learning to Distribute Queries into Web Search Nodes
Sort
View
117
Voted
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
15 years 4 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
94
Voted
MDM
2005
Springer
116views Communications» more  MDM 2005»
15 years 6 months ago
Data dissemination in mobile peer-to-peer networks
In this paper we propose adaptive content-driven routing and data dissemination algorithms for intelligently routing search queries in a peer-to-peer network that supports mobile ...
Thomas Repantis, Vana Kalogeraki
89
Voted
WSDM
2010
ACM
160views Data Mining» more  WSDM 2010»
15 years 10 months ago
Learning Concept Importance Using a Weighted Dependence Model
Modeling query concepts through term dependencies has been shown to have a significant positive effect on retrieval performance, especially for tasks such as web search, where rel...
Michael Bendersky, Donald Metzler, W. Bruce Croft
ADHOC
2005
143views more  ADHOC 2005»
15 years 14 days ago
Active query forwarding in sensor networks
While sensor networks are going to be deployed in diverse application specific contexts, one unifying view is to treat them essentially as distributed databases. The simplest mech...
Narayanan Sadagopan, Bhaskar Krishnamachari, Ahmed...
COLT
1998
Springer
15 years 4 months ago
Self Bounding Learning Algorithms
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
Yoav Freund