Sciweavers

1439 search results - page 49 / 288
» Fast approximation of centrality
Sort
View
JCDCG
2000
Springer
14 years 2 months ago
Structure Theorems for Systems of Segments
We study intersection properties of systems of segments in the plane. In particular, we show that there exists a constant c > 0 such that every system S of n straight-line segme...
János Pach, József Solymosi
ECCV
2010
Springer
13 years 11 months ago
Geodesic Shape Retrieval via Optimal Mass Transport
This paper presents a new method for 2-D and 3-D shape retrieval based on geodesic signatures. These signatures are high dimensional statistical distributions computed by extractin...
Julien Rabin, Gabriel Peyré, Laurent D. Coh...
ENTCS
2008
91views more  ENTCS 2008»
13 years 11 months ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 11 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
PAMI
2008
139views more  PAMI 2008»
13 years 11 months ago
A Fast Algorithm for Learning a Ranking Function from Large-Scale Data Sets
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...
Vikas C. Raykar, Ramani Duraiswami, Balaji Krishna...