Sciweavers

139 search results - page 23 / 28
» Fast perfect sampling from linear extensions
Sort
View
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 8 months ago
Statistical analysis of sketch estimators
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
Florin Rusu, Alin Dobra
ECCV
2010
Springer
14 years 1 months ago
Compressive Acquisition of Dynamic Scenes
Abstract. Compressive sensing (CS) is a new approach for the acquisition and recovery of sparse signals and images that enables sampling rates significantly below the classical Ny...
ALT
2010
Springer
13 years 9 months ago
Online Multiple Kernel Learning: Algorithms and Mistake Bounds
Online learning and kernel learning are two active research topics in machine learning. Although each of them has been studied extensively, there is a limited effort in addressing ...
Rong Jin, Steven C. H. Hoi, Tianbao Yang
INFOCOM
2009
IEEE
14 years 2 months ago
Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
Bilal Sadiq, Seung Jun Baek, Gustavo de Veciana
BMCBI
2007
124views more  BMCBI 2007»
13 years 8 months ago
Protein structural similarity search by Ramachandran codes
Background: Protein structural data has increased exponentially, such that fast and accurate tools are necessary to access structure similarity search. To improve the search speed...
Wei-Cheng Lo, Po-Jung Huang, Chih-Hung Chang, Ping...