5100 search results - page 753 / 1020 » The Linear Complexity of a Graph |
202
click to vote
COLT
2000
Springer
15 years 10 months ago
2000
Springer
In the present paper, we present the theoretical basis, as well as an empirical validation, of a protocol designed to obtain effective VC dimension estimations in the case of a si...
192
click to vote
HYBRID
2000
Springer
15 years 10 months ago
2000
Springer
This paper reports on an on-going project to investigate techniques to diagnose complex dynamical systems that are modeled as hybrid systems. In particular, we examine continuous s...
180
click to vote
CAIP
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. In this paper a new method for analyzing the intrinsic dimensionality (ID) of low dimensional manifolds in high dimensional feature spaces is presented. The basic idea is...
178
click to vote
SIGGRAPH
2000
ACM
15 years 10 months ago
2000
ACM
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
168
click to vote
ICANN
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...