3147 search results - page 257 / 630 » Statistically Hiding Sets |
164
click to vote
ICCAD
1996
IEEE
15 years 11 months ago
1996
IEEE
In a constraint-drivenlayout synthesisenvironment,parasitic constraints are generated and implemented in each phase of the design process to meet a given set of performance specif...
166
click to vote
AUSAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...
183
click to vote
EDBT
2006
ACM
15 years 8 months ago
2006
ACM
Random sampling is a well-known technique for approximate processing of large datasets. We introduce a set of algorithms for incremental maintenance of large random samples on seco...
207
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We propose a framework that learns functional objectes from spatio-temporal data sets such as those abstracted from video. The data is represented as one activity graph t...
161
click to vote
ESANN
2008
15 years 8 months ago
2008
Abstract. We study Winner-Takes-All and rank based Vector Quantization along the lines of the statistical physics of off-line learning. Typical behavior of the system is obtained w...