Sciweavers

3086 search results - page 422 / 618
» Generalized Discriminant Analysis Using a Kernel Approach
Sort
View
KDD
2009
ACM
169views Data Mining» more  KDD 2009»
16 years 1 months ago
On burstiness-aware search for document sequences
As the number and size of large timestamped collections (e.g. sequences of digitized newspapers, periodicals, blogs) increase, the problem of efficiently indexing and searching su...
Theodoros Lappas, Benjamin Arai, Manolis Platakis,...
LPAR
2004
Springer
15 years 12 months ago
The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
Jürgen Giesl, René Thiemann, Peter Sch...
ICALP
1993
Springer
15 years 10 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
ICCS
1997
Springer
15 years 10 months ago
Uncovering the Conceptual Models in Ripple Down Rules
: The need for analysis and modeling of knowledge has been espoused by many researchers as a prerequisite to building knowledge based systems (KBS). This approach has done little t...
Debbie Richards, Paul Compton
ESCIENCE
2006
IEEE
15 years 10 months ago
Designing Workflow Components for e-Science
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
Frank Terpstra, Pieter W. Adriaans