Sciweavers

613 search results - page 82 / 123
» Matching Power
Sort
View
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
14 years 9 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
PERCOM
2003
ACM
14 years 8 months ago
Providing Contextual Information to Pervasive Computing Applications
Pervasive computing applications are increasingly leveraging contextual information from several sources to provide users with behavior appropriate to the environment in which the...
Glenn Judd, Peter Steenkiste
ICCD
2005
IEEE
165views Hardware» more  ICCD 2005»
14 years 5 months ago
Applying Resource Sharing Algorithms to ADL-driven Automatic ASIP Implementation
Presently, Architecture Description Languages (ADLs) are widely used to raise the abstraction level of the design space exploration of Application Specific Instruction-set Proces...
Ernst Martin Witte, Anupam Chattopadhyay, Oliver S...
CVPR
2010
IEEE
14 years 4 months ago
Learning Shift-Invariant Sparse Representation of Actions
A central problem in the analysis of motion capture (Mo- Cap) data is how to decompose motion sequences into primitives. Ideally, a description in terms of primitives should fac...
Yi Li
ICASSP
2009
IEEE
14 years 3 months ago
Detecting bandlimited audio in broadcast television shows
For TV and radio shows containing narrowband speech, Speech-to-text (STT) accuracy on the narrowband audio can be improved by using an acoustic model trained on acoustically match...
Mark C. Fuhs, Qin Jin, Tanja Schultz