13306 search results - page 318 / 2662 » Theoretical Computer Science |
386
click to vote
SDM
2011
SIAM
14 years 10 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
179
click to vote
FOCS
2009
IEEE
16 years 2 months ago
2009
IEEE
We prove that the problem of computing an Arrow-Debreu market equilibrium is PPAD-complete even when all traders use additively separable, piecewise-linear and concave utility fun...
206
click to vote
STACS
2004
Springer
16 years 19 days ago
2004
Springer
Abstract We give a method for approximating any n-dimensional lattice with a lattice Λ whose factor group Zn /Λ has n − 1 cycles of equal length with arbitrary precision. We al...
207
click to vote
GI
2003
Springer
16 years 15 days ago
2003
Springer
: Link analysis is the most important application of web structure mining and serves as a new knowledge source in web information retrieval. However, the mono-dimensional analysis ...
221
click to vote
TLCA
2009
Springer
16 years 1 months ago
2009
Springer
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...