919 search results - page 12 / 184 » Generalizing over Several Learning Settings |
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We study the mixing time of the Glauber dynamics for general spin systems on bounded-degree trees, including the Ising model, the hard-core model (independent sets) and the antife...
ACL
2007
13 years 9 months ago
2007
Previous studies in data-driven dependency parsing have shown that tree transformations can improve parsing accuracy for specific parsers and data sets. We investigate to what ex...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
In non-cooperative multi-agent situations, there cannot exist a globally optimal, yet opponent-independent learning algorithm. Regret-minimization over a set of strategies optimiz...
VLDB
2004
ACM
14 years 7 months ago
2004
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...