Sciweavers

1021 search results - page 43 / 205
» Fast Approximate PCPs
Sort
View
CORR
2010
Springer
182views Education» more  CORR 2010»
15 years 2 months ago
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
Yashodhan Kanoria, Mohsen Bayati, Christian Borgs,...
JCDCG
2000
Springer
15 years 5 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
15 years 2 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»
15 years 1 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
133
Voted
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 2 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...