Sciweavers

9509 search results - page 1821 / 1902
» Complex Event Processing
Sort
View
ICALP
2001
Springer
15 years 10 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
ICCS
2001
Springer
15 years 10 months ago
Inclusion-Based Approximate Reasoning
Nowadays, people start to accept fuzzy rule–based systems as flexible and convenient tools to solve a myriad of ill–defined but otherwise (for humans) straightforward tasks s...
Chris Cornelis, Etienne E. Kerre
ICCS
2001
Springer
15 years 10 months ago
High-Performance Algorithm Engineering for Computational Phylogenetics
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
Bernard M. E. Moret, David A. Bader, Tandy Warnow
ISMIR
2001
Springer
208views Music» more  ISMIR 2001»
15 years 10 months ago
The JRing System for Computer-Assisted Musicological Analysis
Among other factors, high complexity and mandatory expert computer knowledge make many music IR and music analysis systems unsuitable for the majority of largely computer-illitera...
Andreas Kornstädt
IWLCS
2001
Springer
15 years 10 months ago
Explorations in LCS Models of Stock Trading
In previous papers we have described the basic elements for building an economic model consisting of a group of artificial traders functioning and adapting in an environment conta...
Sonia Schulenburg, Peter Ross
« Prev « First page 1821 / 1902 Last » Next »