Sciweavers

29908 search results - page 65 / 5982
» On the complexity of communication complexity
Sort
View
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
13 years 8 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
TCOM
2010
108views more  TCOM 2010»
13 years 8 months ago
On the condition number distribution of complex wishart matrices
Abstract—This paper investigates the distribution of the condition number of complex Wishart matrices. Two closely related measures are considered: the standard condition number ...
Michail Matthaiou, Matthew R. McKay, Peter J. Smit...
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Hilbert's Thirteenth Problem and Circuit Complexity
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Br...
VTC
2007
IEEE
14 years 4 months ago
Energy-Optimized Low-Complexity Control of Power and Rate in Clustered CDMA Sensor Networks with Multirate Constraints
—In this paper, we propose a low-complexity scheme for minimizing energy consumption in a clustered multirate CDMA sensor network with multiple receive antennas by jointly contro...
Chun-Hung Liu
ECAI
2004
Springer
14 years 3 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière