Sciweavers

5246 search results - page 121 / 1050
» Sanitization models and their limitations
Sort
View
ICIP
2004
IEEE
16 years 1 months ago
Background modeling and subtraction by codebook construction
We present a new fast algorithm for background modeling and subtraction. Sample background values at each pixel are quantized into codebooks which represent a compressed form of b...
Kyungnam Kim, Thanarat H. Chalidabhongse, David Ha...
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
16 years 2 days ago
Model compression
Often the best performing supervised learning models are ensembles of hundreds or thousands of base-level classifiers. Unfortunately, the space required to store this many classif...
Cristian Bucila, Rich Caruana, Alexandru Niculescu...
CHI
2003
ACM
16 years 1 days ago
Combined model for text entry rate development
We combine the power law of learning and theoretical upper limit predictions to describe the development of text entry rates from users' first contact to asymptotic expert us...
Poika Isokoski, I. Scott MacKenzie
ICASSP
2009
IEEE
15 years 6 months ago
Robust modeling of musical chord sequences using probabilistic N-grams
The modeling of music as a language is a core issue for a wide range of applications such as polyphonic music retrieval, automatic style identification, audio to symbolic music tr...
Ricardo Scholz, Emmanuel Vincent, Fréd&eacu...
ICC
2008
IEEE
109views Communications» more  ICC 2008»
15 years 6 months ago
Wireless Scheduling Algorithms with O(1) Overhead for M-Hop Interference Model
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
Yung Yi, Mung Chiang