FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
We construct an explicit polynomial f(x1, . . . , xn), with coefficients in {0, 1}, such that the size of any syntactically multilinear arithmetic circuit computing f is at least ...
COMSWARE
2007
IEEE
14 years 6 months ago
2007
IEEE
— Sequence design and resource allocation for a symbol-asynchronous chip-synchronous code division multiple access (CDMA) system is considered in this paper. A simple lower bound...
ADC
2008
Springer
14 years 6 months ago
2008
Springer
With respect to current methods for query evaluation over XML data streams, adoption of certain types of buffering techniques is unavoidable. Under lots of circumstances, the buff...
ICRA
2008
IEEE
14 years 6 months ago
2008
IEEE
— We propose an inverse agreement control strategy for multiple nonholonomic agents that forces the team members to disperse in the workspace in a distributed manner. Both the ca...
GLOBECOM
2008
IEEE
14 years 6 months ago
2008
IEEE
— This paper considers the scheduling problem in wireless networks. We focus on prioritized maximal scheduling, where a maximal scheduler chooses the links in an order specified...
FOCS
2008
IEEE
14 years 6 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
FOCS
2008
IEEE
14 years 6 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
DCC
2008
IEEE
14 years 6 months ago
2008
IEEE
We consider symmetric multiple description coding for the Gaussian source, and provide upper and lower bounds for the individual description rate-distortion function. One of the m...
RSFDGRC
2009
Springer
14 years 6 months ago
2009
Springer
A new clustering strategy is proposed based on interval sets, which is an alternative formulation different from the ones used in the existing studies. Instead of using a single s...
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...