Sciweavers

1068 search results - page 44 / 214
» On Space Bounded Server Algorithms
Sort
View
CORR
2006
Springer
127views Education» more  CORR 2006»
13 years 7 months ago
Space Division Multiple Access with a Sum Feedback Rate Constraint
On a multiantenna broadcast channel, simultaneous transmission to multiple users by joint beamforming and scheduling is capable of achieving high throughput, which grows double log...
Kaibin Huang, Robert W. Heath Jr., Jeffrey G. Andr...
COCOON
2005
Springer
14 years 1 months ago
Finding Longest Increasing and Common Subsequences in Streaming Data
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...
David Liben-Nowell, Erik Vee, An Zhu
COMPGEOM
2010
ACM
14 years 12 hour ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton
MOBICOM
2003
ACM
14 years 28 days ago
Manycast: exploring the space between anycast and multicast in ad hoc networks
The characteristics of ad hoc networks naturally encourage the deployment of distributed services. Although current networks implement group communication methods, they do not sup...
Casey Carter, Seung Yi, Prashant Ratanchandani, Ro...
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...