1622 search results - page 1 / 325 » Learning a Hidden Matching |
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
A system for musical accompaniment is presented in which a computer-driven orchestra follows and learns from a soloist in a concerto-like setting. The system is decomposed into th...
ICIP
2006
IEEE
14 years 6 months ago
2006
IEEE
In this paper we propose a new framework for modeling 2D shapes. A shape is first described by a sequence of local features (e.g., curvature) of the shape boundary. The resulting ...