3082 search results - page 197 / 617 » New Bounds for the Controller Problem |
156
click to vote
ICMCS
2009
IEEE
15 years 2 months ago
2009
IEEE
Network coding has been recently applied to wireless networks to increase throughput. It is typically implemented as a thin layer between MAC and IP, transparently to higher layer...
148
click to vote
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
120
Voted
DBSEC
2010
15 years 6 months ago
2010
Abstract. In considering a problem in access control for scalable multimedia formats, we have developed new methods for constructing a key assignment scheme. Our first contribution...
131
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
120
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...