Sciweavers

4325 search results - page 119 / 865
» Incremental computation with names
Sort
View
KDD
1998
ACM
181views Data Mining» more  KDD 1998»
15 years 10 months ago
Approaches to Online Learning and Concept Drift for User Identification in Computer Security
The task in the computer security domain of anomaly detection is to characterize the behaviors of a computer user (the `valid', or `normal' user) so that unusual occurre...
Terran Lane, Carla E. Brodley
ICCI
1993
15 years 10 months ago
Pattern Matching for Case Analysis: A Computational Definition of Closeness
We propose a conceptually and technically neat method to identify known semantic patterns close to a novel pattern. This occurs in the context of a system to acquire knowledge inc...
Sylvain Delisle, Terry Copeck, Stan Szpakowicz, Ke...
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
15 years 11 months ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...
WADS
2009
Springer
267views Algorithms» more  WADS 2009»
15 years 11 months ago
Computing the Implicit Voronoi Diagram in Triple Precision
In a paper that considered arithmetic precision as a limited resource in the design and analysis of algorithms, Liotta, Preparata and Tamassia defined an “implicit Voronoi diagr...
David L. Millman, Jack Snoeyink
ENTCS
2011
106views more  ENTCS 2011»
15 years 1 months ago
A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi
SUBSEXPL is a system originally developed to visualise reductions, simplifications and normalisations in three important calculi of explicit substitutions and has been applied to...
F. L. C. de Moura, A. V. Barbosa, Mauricio Ayala-R...