Sciweavers

824 search results - page 88 / 165
» Weighted Low-Rank Approximations
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
14 years 8 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
KDD
2000
ACM
101views Data Mining» more  KDD 2000»
15 years 1 months ago
Incremental quantile estimation for massive tracking
Data--call records, internet packet headers, or other transaction records--are coming down a pipe at a ferocious rate, and we need to monitor statistics of the data. There is no r...
Fei Chen, Diane Lambert, José C. Pinheiro
COLT
2007
Springer
15 years 4 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 1 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
BMCBI
2008
117views more  BMCBI 2008»
14 years 10 months ago
New resampling method for evaluating stability of clusters
Background: Hierarchical clustering is a widely applied tool in the analysis of microarray gene expression data. The assessment of cluster stability is a major challenge in cluste...
Irina Gana Dresen, Tanja Boes, Johannes Hüsin...