3082 search results - page 24 / 617 » New Bounds for the Controller Problem |
207
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
173
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
173
click to vote
FOCS
2005
IEEE
16 years 5 days ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
193
click to vote
STOC
2012
ACM
13 years 9 months ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
169
click to vote
DAM
2007
15 years 6 months ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...