377 search results - page 69 / 76 » A Value Theory of Meta-Learning Algorithms |
150
Voted
CADE
2005
Springer
16 years 4 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
126
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
141
Voted
SIGIR
2009
ACM
15 years 10 months ago
2009
ACM
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
169
Voted
WWW
2008
ACM
16 years 4 months ago
2008
ACM
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of ...
127
Voted
WWW
2007
ACM
16 years 4 months ago
2007
ACM
A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configura...