Sciweavers

216 search results - page 21 / 44
» From Constraints to Finite Automata to Filtering Algorithms
Sort
View
ICAC
2005
IEEE
14 years 2 months ago
Multi-resolution Abnormal Trace Detection Using Varied-length N-grams and Automata
Detection and diagnosis of faults in a large-scale distributed system is a formidable task. Interest in monitoring and using traces of user requests for fault detection has been o...
Guofei Jiang, Haifeng Chen, Cristian Ungureanu, Ke...
ECCV
2004
Springer
14 years 10 months ago
Sparse Finite Elements for Geodesic Contours with Level-Sets
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
Martin Weber, Andrew Blake, Roberto Cipolla
SIAMJO
2008
100views more  SIAMJO 2008»
13 years 8 months ago
On the Global Solution of Linear Programs with Linear Complementarity Constraints
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
Jing Hu, John E. Mitchell, Jong-Shi Pang, Kristin ...
ACL
1997
13 years 9 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
13 years 10 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn