Sciweavers

244 search results - page 34 / 49
» On-Line Probability, Complexity and Randomness
Sort
View
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
14 years 1 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
CMPB
2010
171views more  CMPB 2010»
13 years 3 months ago
Metabolica: A statistical research tool for analyzing metabolic networks
Steady state flux balance analysis (FBA) for cellular metabolism is used, e.g., to seek information on the activity of the different pathways under equilibrium conditions, or as a...
Jenni Heino, Daniela Calvetti, Erkki Somersalo
TWC
2010
13 years 3 months ago
Multiple antenna spectrum sensing in cognitive radios
In this paper, we consider the problem of spectrum sensing by using multiple antenna in cognitive radios when the noise and the primary user signal are assumed as independent compl...
Abbas Taherpour, Masoumeh Nasiri-Kenari, Saeed Gaz...
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
12 years 8 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 9 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran