Sciweavers

7978 search results - page 431 / 1596
» Combining shared-coin algorithms
Sort
View
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
13 years 9 months ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park
PODC
2012
ACM
13 years 9 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...
ECCV
2006
Springer
16 years 8 months ago
Background Cut
Abstract. In this paper, we introduce background cut, a high quality and realtime foreground layer extraction algorithm. From a single video sequence with a moving foreground objec...
Jian Sun, Weiwei Zhang, Xiaoou Tang, Heung-Yeung S...
PODS
2003
ACM
158views Database» more  PODS 2003»
16 years 6 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
ICANNGA
2007
Springer
149views Algorithms» more  ICANNGA 2007»
16 years 28 days ago
Using Real-Valued Meta Classifiers to Integrate and Contextualize Binding Site Predictions
Currently the best algorithms for transcription factor binding site predictions are severely limited in accuracy. However, a non-linear combination of these algorithms could improv...
Mark Robinson, Offer Sharabi, Yi Sun, Rod Adams, R...