Sciweavers

543 search results - page 93 / 109
» Methods for Empirical Game-Theoretic Analysis
Sort
View
JMLR
2002
144views more  JMLR 2002»
13 years 7 months ago
Round Robin Classification
In this paper, we discuss round robin classification (aka pairwise classification), a technique for handling multi-class problems with binary classifiers by learning one classifie...
Johannes Fürnkranz
PVLDB
2008
144views more  PVLDB 2008»
13 years 7 months ago
Mining search engine query logs via suggestion sampling
Many search engines and other web applications suggest auto-completions as the user types in a query. The suggestions are generated from hidden underlying databases, such as query...
Ziv Bar-Yossef, Maxim Gurevich
INFFUS
2010
121views more  INFFUS 2010»
13 years 6 months ago
The statistical mechanics of belief sharing in multi-agent systems
- Many exciting, emerging applications require that a group of agents share a coherent view of the world given spatial distribution, incomplete and uncertain sensors, and communica...
Robin Glinton, Katia P. Sycara, David Scerri, Paul...
IWPC
2010
IEEE
13 years 6 months ago
Understanding and Auditing the Licensing of Open Source Software Distributions
—Free and open source software (FOSS) is often distributed in binary packages, sometimes part of GNU/Linux operating system distributions, or part of products distributed/sold to...
Daniel M. Germán, Massimiliano Di Penta, Ju...
TKDE
2010
168views more  TKDE 2010»
13 years 6 months ago
Completely Lazy Learning
—Local classifiers are sometimes called lazy learners because they do not train a classifier until presented with a test sample. However, such methods are generally not complet...
Eric K. Garcia, Sergey Feldman, Maya R. Gupta, San...