3415 search results - page 238 / 683 » Lower bounds on kernelization |
209
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we derive a precise expression of spatial degrees of freedom (DOF) for two mutually interfering broadcast channels (IFBC) as a function of arbitrary numbers of t...
186
click to vote
CAV
2007
Springer
16 years 1 months ago
2007
Springer
ng-Lens Abstraction for Markov Decision Processes⋆ In Proc. of CAV 2007: 19th International Conference on Computer-Aided Verification, Lectures Notes in Computer Science. c Spri...
181
click to vote
COCO
2005
Springer
16 years 22 days ago
2005
Springer
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
176
click to vote
IPSN
2005
Springer
16 years 21 days ago
2005
Springer
We bound the number of sensors required to achieve a desired level of sensing accuracy in a discrete sensor network application (e.g. distributed detection). We model the state of...
143
click to vote
MFCS
2004
Springer
16 years 16 days ago
2004
Springer
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...