1132 search results - page 161 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
147
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
167
click to vote
IWCMC
2009
ACM
16 years 27 days ago
2009
ACM
This paper addresses the problem of optimal cooperative spectrum sensing in a cognitive-enabled sensor network where cognitive sensors can cooperate in the sensing of the spectrum...
149
click to vote
ER
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...
188
click to vote
STACS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
193
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...