146 search results - page 22 / 30 » Computably Enumerable Sets and Quasi-Reducibility |
102
Voted
CVPR
2007
IEEE
15 years 7 months ago
2007
IEEE
We propose a framework for general multiple target tracking, where the input is a set of candidate regions in each frame, as obtained from a state of the art background learning, ...
108
click to vote
DAC
1994
ACM
15 years 4 months ago
1994
ACM
Abstract - We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology wh...
100
Voted
COLT
2006
Springer
15 years 4 months ago
2006
Springer
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
89
Voted
DISOPT
2007
15 years 18 days ago
2007
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
118
Voted
LATA
2011
Springer
14 years 3 months ago
2011
Springer
In this paper we propose a hierarchy of classes of languages, generated by networks of evolutionary processors with the filters in several special classes of regular sets. More p...