Sciweavers

8825 search results - page 3 / 1765
» All for one or one for all
Sort
View
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
14 years 5 months ago
One sketch for all: fast algorithms for compressed sensing
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...
ASIAMS
2008
IEEE
13 years 12 months ago
High-Performance Carry Select Adder Using Fast All-One Finding Logic
A carry-select adder(CSA) can be implemented by using single ripple carry adder and an add-one circuit instead of using dual ripple-carry adders to reduce the area and power but w...
Sun Yan, Zhang Xin, Jin Xi
STOC
1989
ACM
95views Algorithms» more  STOC 1989»
13 years 9 months ago
A Hard-Core Predicate for all One-Way Functions
Oded Goldreich, Leonid A. Levin
CIDR
2007
106views Algorithms» more  CIDR 2007»
13 years 6 months ago
One table stores all: Enabling painless free-and-easy data publishing and sharing
In this paper, we present a free-and-easy data publishing and sharing system based on folksonomy. The system accepts data objects described with user-created metadata, called data...
Beng Chin Ooi, Bei Yu, Guoliang Li
NIPS
2008
13 years 6 months ago
One sketch for all: Theory and Application of Conditional Random Sampling
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
Ping Li, Kenneth Ward Church, Trevor Hastie