Sciweavers

17329 search results - page 169 / 3466
» Improved non-approximability results
Sort
View
WSDM
2009
ACM
115views Data Mining» more  WSDM 2009»
14 years 4 months ago
Discovering and using groups to improve personalized search
Personalized Web search takes advantage of information about an individual to identify the most relevant results for that person. A challenge for personalization lies in collectin...
Jaime Teevan, Meredith Ringel Morris, Steve Bush
ADHOCNETS
2009
Springer
14 years 4 months ago
Improved Topology Control Algorithms for Simple Mobile Networks
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...
Fei Che, Errol L. Lloyd, Liang Zhao
ESWS
2009
Springer
14 years 4 months ago
Improving Ontology Matching Using Meta-level Learning
Despite serious research efforts, automatic ontology matching still suffers from severe problems with respect to the quality of matching results. Existing matching systems trade-of...
Kai Eckert, Christian Meilicke, Heiner Stuckenschm...
CICLING
2007
Springer
14 years 4 months ago
Text Categorization for Improved Priors of Word Meaning
Distributions of the senses of words are often highly skewed. This fact is exploited by word sense disambiguation (WSD) systems which back off to the predominant (most frequent) s...
Rob Koeling, Diana McCarthy, John Carroll
SIGIR
2005
ACM
14 years 3 months ago
Surrogate scoring for improved metasearch precision
We describe a method for improving the precision of metasearch results based upon scoring the visual features of documents' surrogate representations. These surrogate scores ...
Steven M. Beitzel, Eric C. Jensen, Ophir Frieder, ...