Sciweavers

352 search results - page 36 / 71
» Fast Graph Pattern Matching
Sort
View
CC
2001
Springer
177views System Software» more  CC 2001»
14 years 2 days ago
Imperative Program Transformation by Rewriting
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
David Lacey, Oege de Moor
CIKM
2008
Springer
13 years 9 months ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 7 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar
PLILP
1998
Springer
13 years 11 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
ICMCS
2005
IEEE
136views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Human Posture Recognition with Convex Programming
We present a novel human posture recognition method using convex programming based matching schemes. Instead of trying to segment the object from the background, we develop a nove...
Hao Jiang, Ze-Nian Li, Mark S. Drew