Sciweavers

8600 search results - page 337 / 1720
» Measuring with Timed Patterns
Sort
View
130
Voted
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 4 months ago
On Finding Frequent Patterns in Event Sequences
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Andrea Campagna, Rasmus Pagh
ALMOB
2006
80views more  ALMOB 2006»
15 years 3 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
120
Voted
COR
2007
97views more  COR 2007»
15 years 3 months ago
Two-stage general block patterns for the two-dimensional cutting problem
This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the two-stage general block pattern that can be cut into ...
Yaodong Cui, Xianquan Zhang
PR
2006
76views more  PR 2006»
15 years 3 months ago
A pattern recognition-based approach for phylogenetic network construction with constrained recombination
The tree representation of evolutionary relationship oversimplifies the view of the process of evolution as it cannot take into account the events such as horizontal gene transfer...
M. A. H. Zahid, Ankush Mittal, Ramesh Chandra Josh...
JAIR
2007
107views more  JAIR 2007»
15 years 3 months ago
Compressed Pattern Databases
A pattern database (PDB) is a heuristic function implemented as a lookup table that stores the lengths of optimal solutions for subproblem instances. Standard PDBs have a distinct...
Ariel Felner, Richard E. Korf, Ram Meshulam, Rober...