130 search results - page 16 / 26 » Optimal Lower Bounds on Regular Expression Size Using Commun... |
PODC
2009
ACM
14 years 8 months ago
2009
ACM
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
ESA
2004
Springer
14 years 28 days ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
PIMRC
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract-We study the design parameters of pilot-symbolassisted modulation (PSAM) schemes for spatially correlated single-input multiple-output (SIMO) systems in time-varying Gauss...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper, we investigate the maximization of the amount of gathered data in a clustered wireless sensor network (WSN). The amount of gathered data is maximized by (1) choosing...