Sciweavers

4616 search results - page 255 / 924
» The Communication Complexity of Correlation
Sort
View
CVPR
2008
IEEE
16 years 8 months ago
An experimental study of employing visual appearance as a phenotype
Visual and non-visual data are often related through complex, indirect links, thus making the prediction of one from the other difficult. Examples include the partiallyunderstood ...
Lior Wolf, Yoni Donner
DAC
2005
ACM
16 years 7 months ago
Correlation-preserved non-gaussian statistical timing analysis with quadratic timing model
Recent study shows that the existing first order canonical timing model is not sufficient to represent the dependency of the gate delay on the variation sources when processing an...
Lizheng Zhang, Weijen Chen, Yuhen Hu, John A. Gubn...
189
Voted
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 7 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
SIGMOD
2004
ACM
154views Database» more  SIGMOD 2004»
16 years 6 months ago
Compressing Historical Information in Sensor Networks
We are inevitably moving into a realm where small and inexpensive wireless devices would be seamlessly embedded in the physical world and form a wireless sensor network in order t...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
QEST
2009
IEEE
16 years 1 months ago
Comparison of Two Output Models for the BMAP/MAP/1 Departure Process
—The departure process of a BMAP/MAP/1 queue can be approximated in different ways: as a Markovian arrival process (MAP) or as a matrix-exponential process (MEP). Both approximat...
Qi Zhang, Armin Heindl, Evgenia Smirni, Andreas St...