Sciweavers

824 search results - page 33 / 165
» Weighted Low-Rank Approximations
Sort
View
ICIP
2004
IEEE
14 years 10 months ago
Minimizing a weighted error criterion for spatial error concealment of missing image data
In this contribution we present an algorithm for spatial error concealment of lost image data caused by transmission of images in error prone environments. The surrounding correct...
André Kaup, Katrin Meisinger
NIPS
2003
13 years 9 months ago
Perspectives on Sparse Bayesian Learning
Recently, relevance vector machines (RVM) have been fashioned from a sparse Bayesian learning (SBL) framework to perform supervised learning using a weight prior that encourages s...
David P. Wipf, Jason A. Palmer, Bhaskar D. Rao
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
14 years 8 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler
SDM
2009
SIAM
331views Data Mining» more  SDM 2009»
14 years 5 months ago
Privacy Preservation in Social Networks with Sensitive Edge Weights.
With the development of emerging social networks, such as Facebook and MySpace, security and privacy threats arising from social network analysis bring a risk of disclosure of con...
Jie Wang, Jinze Liu, Jun Zhang, Lian Liu
KDD
2009
ACM
298views Data Mining» more  KDD 2009»
14 years 3 months ago
Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering
One-Class Collaborative Filtering (OCCF) is a task that naturally emerges in recommender system settings. Typical characteristics include: Only positive examples can be observed, ...
Rong Pan, Martin Scholz