Sciweavers

102 search results - page 9 / 21
» Finding frequent co-occurring terms in relational keyword se...
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Trading off solution cost for smaller runtime in DCOP search algorithms
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...
William Yeoh, Sven Koenig, Xiaoxun Sun
SIGIR
2003
ACM
14 years 1 months ago
Stuff I've seen: a system for personal information retrieval and re-use
Most information retrieval technologies are designed to facilitate information discovery. However, much knowledge work involves finding and re-using previously seen information. W...
Susan T. Dumais, Edward Cutrell, Jonathan J. Cadiz...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
WWW
2005
ACM
14 years 8 months ago
Information search and re-access strategies of experienced web users
Experienced web users have strategies for information search and re-access that are not directly supported by web browsers or search engines. We studied how prevalent these strate...
Anne Aula, Mika Käki, Natalie Jhaveri
WWW
2009
ACM
14 years 8 months ago
RuralCafe: web search in the rural developing world
The majority of people in rural developing regions do not have access to the World Wide Web. Traditional network connectivity technologies have proven to be prohibitively expensiv...
Jay Chen, Lakshminarayanan Subramanian, Jinyang Li