196 search results - page 3 / 40 » PASS Approximation |
ISCAS
2007
IEEE
15 years 8 months ago
2007
IEEE
—This paper proposes a multiplexing scheme to realize an I/Q channel time-interleaved (TI) band-pass sigmadelta modulator (BPSDM) that shares OTAs to minimize power consumption a...
138
Voted
NIPS
2007
15 years 3 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
VLDB
2005
ACM
15 years 7 months ago
2005
ACM
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...
121
click to vote
ESANN
2008
15 years 3 months ago
2008
Clustering algorithms such as k-means, the self-organizing map (SOM), or Neural Gas (NG) constitute popular tools for automated information analysis. Since data sets are becoming l...
130
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
Training of conditional random fields often takes the form of a double-loop procedure with message-passing inference in the inner loop. This can be very expensive, as the need to...