Sciweavers

268 search results - page 7 / 54
» Generalized pattern matching using orbit decomposition
Sort
View
PPDP
2005
Springer
15 years 3 months ago
Formal validation of pattern matching code
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
Claude Kirchner, Pierre-Etienne Moreau, Antoine Re...
77
Voted
SMA
2003
ACM
15 years 2 months ago
Geometric constraint solving via C-tree decomposition
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...
Xiao-Shan Gao, Gui-Fang Zhang
SIGMOD
2009
ACM
218views Database» more  SIGMOD 2009»
15 years 9 months ago
DejaVu: declarative pattern matching over live and archived streams of events
DejaVu is an event processing system that integrates declarative pattern matching over live and archived streams of events on top of a novel system architecture. We propose to dem...
Nihal Dindar, Baris Güç, Patrick Lau, ...
SIAMIS
2011
14 years 4 months ago
Locally Parallel Texture Modeling
This article presents a new adaptive framework for locally parallel texture modeling. Oscillating patterns are modeled with functionals that constrain the local Fourier decompositi...
Pierre Maurel, Jean-François Aujol, Gabriel...
CIKM
2008
Springer
14 years 11 months ago
SNIF TOOL: sniffing for patterns in continuous streams
Continuous time-series sequence matching, specifically, matching a numeric live stream against a set of predefined pattern sequences, is critical for domains ranging from fire spr...
Abhishek Mukherji, Elke A. Rundensteiner, David C....