2434 search results - page 359 / 487 » Algorithmic Randomness of Closed Sets |
130
click to vote
COLT
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
157
click to vote
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
Automatically understanding events happening at a site is the ultimate goal of visual surveillance system. This paper investigates the challenges faced by automated surveillance s...
146
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
158
click to vote
AI
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
180
click to vote
COCO
1998
Springer
15 years 10 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...