Sciweavers

674 search results - page 121 / 135
» Arguments and Results
Sort
View
FOCS
2007
IEEE
14 years 14 days ago
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
Arkadev Chattopadhyay
INFOCOM
2000
IEEE
14 years 5 days ago
A Predictability Analysis of Network Traffic
This paper assesses the predictability of network traffic by considering two metrics: (1) how far into the future a traffic rate process can be predicted with bounded error; (2) w...
Aimin Sang, San-qi Li
MCU
2004
126views Hardware» more  MCU 2004»
13 years 10 months ago
Universality and Cellular Automata
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
Klaus Sutner
GEOINFORMATICA
2008
123views more  GEOINFORMATICA 2008»
13 years 8 months ago
Efficient Implementation Techniques for Topological Predicates on Complex Spatial Objects
Topological relationships like overlap, inside, meet, and disjoint uniquely characterize the relative position between objects in space. For a long time, they have been a focus of...
Reasey Praing, Markus Schneider
BMCBI
2005
84views more  BMCBI 2005»
13 years 8 months ago
A note on generalized Genome Scan Meta-Analysis statistics
Background: Wise et al. introduced a rank-based statistical technique for meta-analysis of genome scans, the Genome Scan Meta-Analysis (GSMA) method. Levinson et al. recently desc...
James A. Koziol, Anne C. Feng