2944 search results - page 259 / 589 » Improving Bound Propagation |
174
click to vote
NIPS
2004
15 years 8 months ago
2004
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
129
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We show that the maximum possible energy benefit of network coding for multiple unicast on wireless networks is at least 3. This improves the previously known lower bound of 2.4 f...
130
Voted
CPC
2008
15 years 6 months ago
2008
Suppose that n > (log k)ck , where c is a fixed positive constant. We prove that no matter how the edges of Kn are colored with k colors, there is a copy of K4 whose edges rece...
145
click to vote
IPL
2008
15 years 6 months ago
2008
Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language re...
159
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
This paper deals with new infinite families of small dense sets in desarguesian projective planes PG(2, q). A general construction of dense sets of size about 3q2/3 is presented....