Sciweavers

128 search results - page 19 / 26
» Updating Probabilities with Data and Moments
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 5 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
14 years 11 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
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
15 years 10 months ago
Eigenspace-based anomaly detection in computer systems
We report on an automated runtime anomaly detection method at the application layer of multi-node computer systems. Although several network management systems are available in th...
Hisashi Kashima, Tsuyoshi Idé
AUTONOMICS
2007
ACM
15 years 2 months ago
Adaptive learning of semantic locations and routes
Abstract. Adaptation of devices and applications based on contextual information has a great potential to enhance usability and mitigate the increasing complexity of mobile devices...
Keshu Zhang, Haifeng Li, Kari Torkkola, Mike Gardn...
ECRTS
2004
IEEE
15 years 1 months ago
An Architecture for Real-Time Active Content Distribution
The phenomenal growth of the world-wide web has made it the most popular Internet application today. Web caching and content distribution services have been recognized as valuable...
Chengdu Huang, Seejo Sebastine, Tarek F. Abdelzahe...