1658 search results - page 35 / 332 » Learning Unknown Graphs |
160
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
161
Voted
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 ...
145
Voted
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumpti...
135
click to vote
JCO
2007
15 years 2 months ago
2007
This paper studies the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that t(G) tests are sufficient to identify an u...
COLT
2003
Springer
15 years 7 months ago
2003
Springer