Sciweavers

510 search results - page 2 / 102
» Complexity measures and decision tree complexity: a survey
Sort
View
ECCC
2010
108views more  ECCC 2010»
13 years 2 months ago
Improved bounds for the randomized decision tree complexity of recursive majority
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
Frédéric Magniez, Ashwin Nayak, Mikl...
INFOVIS
2003
IEEE
13 years 10 months ago
Visualization of Large-Scale Customer Satisfaction Surveys Using a Parallel Coordinate Tree
Satisfaction surveys are an important measurement tool in fields such as market research or human resources management. Serious studies consist of numerous questions and contain a...
Dominique Brodbeck, Luc Girardin
GLOBECOM
2007
IEEE
13 years 11 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
13 years 8 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 5 months ago
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
Rahul Jain, Hartmut Klauck, Miklos Santha