Sciweavers

500 search results - page 87 / 100
» A Sample Approximation Approach for Optimization with Probab...
Sort
View
MLG
2007
Springer
14 years 2 months ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
SIGMETRICS
2008
ACM
111views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Predicting the resource consumption of network intrusion detection systems
Abstract. When installing network intrusion detection systems (NIDSs), operators are faced with a large number of parameters and analysis options for tuning trade-offs between dete...
Holger Dreger, Anja Feldmann, Vern Paxson, Robin S...
CVPR
2008
IEEE
14 years 10 months ago
Conditional density learning via regression with application to deformable shape segmentation
Many vision problems can be cast as optimizing the conditional probability density function p(C|I) where I is an image and C is a vector of model parameters describing the image. ...
Jingdan Zhang, Shaohua Kevin Zhou, Dorin Comaniciu...
PSB
2004
13 years 9 months ago
Multiplexing Schemes for Generic SNP Genotyping Assays
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
Roded Sharan, Amir Ben-Dor, Zohar Yakhini
ECCV
2008
Springer
14 years 9 months ago
Compressive Sensing for Background Subtraction
Abstract. Compressive sensing (CS) is an emerging field that provides a framework for image recovery using sub-Nyquist sampling rates. The CS theory shows that a signal can be reco...
Volkan Cevher, Aswin C. Sankaranarayanan, Marco F....