9842 search results - page 1762 / 1969 » Problem complexity |
176
click to vote
JCSS
2000
15 years 6 months ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
189
Voted
HPCA
2006
IEEE
16 years 6 months ago
2006
IEEE
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
191
click to vote
APNOMS
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we focus on the scheme for the route optimization in 6LoWPAN based MANEMO environments. If 6LoWPAN mobile routers for supporting NEMO protocol are organized by neste...
147
click to vote
ICC
2007
IEEE
16 years 25 days ago
2007
IEEE
— For the single-group multicast scenario, where K users are served with the same data by a base station equipped with N antennas, we present two beamforming algorithms which out...
160
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...