446 search results - page 71 / 90 » A Combinatorial Theorem for Trees |
125
click to vote
TIT
2010
14 years 6 months ago
2010
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
118
click to vote
ICALP
2009
Springer
16 years 2 days ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
101
click to vote
WIA
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
AAAI
1998
15 years 1 months ago
1998
Manydesign problems are solved using multiple levels of abstraction, wherea design at one level has combinatorially manychildren at the next level. A stochastic optimization metho...
81
Voted
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...