Sciweavers

1245 search results - page 80 / 249
» Binary Sparse Coding
Sort
View
106
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Approximate nearest-subspace representations for sound mixtures
In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representat...
Paris Smaragdis
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
16 years 3 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
137
Voted
PRL
2008
133views more  PRL 2008»
15 years 2 months ago
Better multiclass classification via a margin-optimized single binary problem
We develop a new multiclass classification method that reduces the multiclass problem to a single binary classifier (SBC). Our method constructs the binary problem by embedding sm...
Ran El-Yaniv, Dmitry Pechyony, Elad Yom-Tov
131
Voted
DYNAMO
2000
110views more  DYNAMO 2000»
15 years 4 months ago
Machine-adaptable dynamic binary translation
Dynamic binary translation is the process of translating and optimizing executable code for one machine to another at runtime, while the program is "executing" on the ta...
David Ung, Cristina Cifuentes
143
Voted
TIP
2008
107views more  TIP 2008»
15 years 2 months ago
Sampling-Based Correlation Estimation for Distributed Source Coding Under Rate and Complexity Constraints
In many practical distributed source coding (DSC) applications, correlation information has to be estimated at the encoder in order to determine the encoding rate. Coding efficien...
Ngai-Man Cheung, Huisheng Wang, Antonio Ortega