450 search results - page 63 / 90 » Algorithmic uses of the Feferman-Vaught Theorem |
JMLR
2008
13 years 8 months ago
2008
We argue that when objects are characterized by many attributes, clustering them on the basis of a random subset of these attributes can capture information on the unobserved attr...
STOC
2006
ACM
14 years 2 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
GLOBECOM
2006
IEEE
14 years 2 months ago
2006
IEEE
—The current best-effort Internet does not guarantee the bandwidth availability between a receiver and a sender, and so renders any quality-of-service (QoS) control difficult, if...
ECML
2003
Springer
14 years 2 months ago
2003
Springer
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
NIPS
2007
13 years 10 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...