Sciweavers

3415 search results - page 281 / 683
» Lower bounds on kernelization
Sort
View
AML
2008
91views more  AML 2008»
15 years 6 months ago
On meta complexity of propositional formulas and propositional proofs
A new approach to defining complexity of propositional formulas and proofs is suggested. Instead of measuring the size of these syntactical structures in the propositional languag...
Pavel Naumov
CORR
2008
Springer
73views Education» more  CORR 2008»
15 years 6 months ago
Energy Benefit of Network Coding for Multiple Unicast in Wireless Networks
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...
Jasper Goseling, Jos H. Weber
DCC
2010
IEEE
15 years 6 months ago
On hyperovals of polar spaces
We derive lower and upper bounds for the size of a hyperoval of a finite polar space of rank r {2, 3}. We give a computer-free proof for the uniqueness, up to isomorphism, of the...
Bart De Bruyn
124
Voted
DCG
2010
61views more  DCG 2010»
15 years 6 months ago
Vertex Numbers of Weighted Faces in Poisson Hyperplane Mosaics
In the random mosaic generated by a stationary Poisson hyperplane process in Rd , we consider the typical k-face weighted by the j-dimensional volume of the j-skeleton (0 j k d)...
Rolf Schneider
144
Voted
DAM
2008
89views more  DAM 2008»
15 years 6 months ago
T-shift synchronization codes
In this paper we give a construction of T-shift synchronization codes, i.e. block codes capable of correcting synchronization shifts of length at most T in either direction (left ...
Rudolf Ahlswede, Bernhard Balkenhol, Christian Dep...