Sciweavers

3495 search results - page 547 / 699
» On the random satisfiable process
Sort
View
ICA
2004
Springer
15 years 11 months ago
Postnonlinear Overcomplete Blind Source Separation Using Sparse Sources
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...
Fabian J. Theis, Shun-ichi Amari
CCS
2006
ACM
15 years 10 months ago
Packet vaccine: black-box exploit detection and signature generation
In biology, a vaccine is a weakened strain of a virus or bacterium that is intentionally injected into the body for the purpose of stimulating antibody production. Inspired by thi...
XiaoFeng Wang, Zhuowei Li, Jun Xu, Michael K. Reit...
INFOCOM
1991
IEEE
15 years 10 months ago
Queueing Performance with Impatient Customers
customer which exceeds its deadline will either leave the queue without service or stay in the queue to get unsucWe consider the problem of scheduling impatient CUS- cessful servic...
Zheng-Xue Zhao, Shivendra S. Panwar, Donald F. Tow...
NAACL
2003
15 years 7 months ago
Implicit Trajectory Modeling through Gaussian Transition Models for Speech Recognition
It is well known that frame independence assumption is a fundamental limitation of current HMM based speech recognition systems. By treating each speech frame independently, HMMs ...
Hua Yu, Tanja Schultz
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
15 years 7 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand