2004 search results - page 100 / 401 » Sampling from large graphs |
114
click to vote
CIARP
2008
Springer
15 years 5 months ago
2008
Springer
The performance of supervised learners depends on the presence of a relatively large labeled sample. This paper proposes an automatic ongoing learning system, which is able to inco...
143
click to vote
TPDS
2010
15 years 1 months ago
2010
This paper studies the problem of realizing a common software clock among a large set of nodes without an external time reference (i.e., internal clock synchronization), any centr...
166
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
117
click to vote
CCCG
2008
15 years 4 months ago
2008
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
150
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...