1757 search results - page 125 / 352 » Concepts From Time Series |
158
click to vote
OSS
2009
Springer
16 years 1 months ago
2009
Springer
This paper presents a novel method and algorithm to measure the size of an open source project’s user base and the level of potential user interest that it generates. Previously ...
177
click to vote
ALGORITHMICA
2000
15 years 6 months ago
2000
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
182
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
The major challenge in mining data streams is the issue of concept drift, the tendency of the underlying data generation process to change over time. In this paper, we propose a g...
187
click to vote
SAC
2005
ACM
16 years 6 days ago
2005
ACM
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
219
click to vote
UPP
2004
Springer
16 years 3 hour ago
2004
Springer
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...