3708 search results - page 94 / 742 » Approximating Betweenness Centrality |
82
Voted
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper addresses the problem of approximate singular value decomposition of large dense matrices that arises naturally in many machine learning applications. We discuss two re...
69
Voted
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
We attempt to quantify the possible gains that can be achieved by examining a rate-distortion competition between a conventional and a compressive sampling solution to data rate r...
105
click to vote
IDEAS
2007
IEEE
15 years 7 months ago
2007
IEEE
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
110
Voted
PSIVT
2007
Springer
15 years 6 months ago
2007
Springer
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface E...
WADS
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...