Sciweavers

3499 search results - page 186 / 700
» On the local optimality of LambdaRank
Sort
View
IPL
2007
95views more  IPL 2007»
15 years 1 months ago
Optimal implementations of UPGMA and other common clustering algorithms
In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algo...
Ilan Gronau, Shlomo Moran
SIAMJO
2010
133views more  SIAMJO 2010»
15 years 5 days ago
Infeasibility Detection and SQP Methods for Nonlinear Optimization
This paper addresses the need for nonlinear programming algorithms that provide fast local convergence guarantees no matter if a problem is feasible or infeasible. We present an a...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
16 years 2 months ago
Knowledge transfer via multiple model local structure mapping
The effectiveness of knowledge transfer using classification algorithms depends on the difference between the distribution that generates the training examples and the one from wh...
Jing Gao, Wei Fan, Jing Jiang, Jiawei Han
157
Voted
FOCS
2006
IEEE
15 years 7 months ago
Local Graph Partitioning using PageRank Vectors
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
15 years 7 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra