2004 search results - page 51 / 401 » Sampling from large graphs |
GD
2006
Springer
15 years 3 months ago
2006
Springer
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
103
click to vote
STACS
2007
Springer
15 years 6 months ago
2007
Springer
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...
105
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we present an empirical study of object category recognition using generalized samples and a set of sequential tests. We study 33 categories, each consisting of a sm...
SIGMETRICS
2010
ACM
15 years 4 months ago
2010
ACM
We propose a new approach to optimize the deployment and the sampling rates of network monitoring tools, such as Netflow, on a large IP network. It reduces to solving a stochasti...
111
click to vote
BMCBI
2005
14 years 11 months ago
2005
Motivation: In cluster analysis, the validity of specific solutions, algorithms, and procedures present significant challenges because there is no null hypothesis to test and no &...