Sciweavers

1578 search results - page 217 / 316
» Algorithmic randomness of continuous functions
Sort
View
ASPLOS
2012
ACM
12 years 4 months ago
An update-aware storage system for low-locality update-intensive workloads
Traditional storage systems provide a simple read/write interface, which is inadequate for low-locality update-intensive workloads because it limits the disk scheduling flexibili...
Dilip Nijagal Simha, Maohua Lu, Tzi-cker Chiueh
CVPR
2008
IEEE
14 years 10 months ago
Granularity and elasticity adaptation in visual tracking
The observation models in tracking algorithms are critical to both tracking performance and applicable scenarios but are often simplified to focus on fixed level of certain target...
Ming Yang, Ying Wu
CISS
2008
IEEE
14 years 3 months ago
1-Bit compressive sensing
Abstract—Compressive sensing is a new signal acquisition technology with the potential to reduce the number of measurements required to acquire signals that are sparse or compres...
Petros Boufounos, Richard G. Baraniuk
ICASSP
2008
IEEE
14 years 3 months ago
Compressive wireless arrays for bearing estimation
Joint processing of sensor array outputs improves the performance of parameter estimation and hypothesis testing problems beyond the sum of the individual sensor processing result...
Volkan Cevher, Ali Cafer Gurbuz, James H. McClella...
FOCS
2007
IEEE
14 years 3 months ago
Lower Bounds on Signatures From Symmetric Primitives
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
Boaz Barak, Mohammad Mahmoody-Ghidary