7228 search results - page 107 / 1446 » From Algorithmic to Subjective Randomness |
144
click to vote
SPAA
1993
ACM
15 years 7 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
128
click to vote
ICIP
2007
IEEE
16 years 5 months ago
2007
IEEE
Abstract-- This paper presents an edge-directed image interpolation algorithm. In the proposed algorithm, the edge directions are implicitly estimated with a statistical-based appr...
130
Voted
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
110
click to vote
COLCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
Peer-to-peer applications can benefit from human friendship networks (e.g., e-mail contacts or instant message buddy lists). However these are not always available. We propose an...
157
click to vote
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors gra...