Sciweavers

1529 search results - page 172 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
CIKM
1998
Springer
15 years 8 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
CP
2006
Springer
15 years 8 months ago
Static and Dynamic Structural Symmetry Breaking
We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (CSPs). We show that the dynamic dominance checks used in symmetry breaking by dom...
Pierre Flener, Justin Pearson, Meinolf Sellmann, P...
109
Voted
NCA
2007
IEEE
15 years 10 months ago
A Topological Analysis of Monitor Placement
The Internet is an extremely complex system, and it is essential that we be able to make accurate measurements in order to understand its underlying behavior or to detect improper...
Alden W. Jackson, Walter C. Milliken, Cesar A. San...
ICDAR
2011
IEEE
14 years 4 months ago
A Lattice-Based Method for Keyword Spotting in Online Chinese Handwriting
——This paper proposes a lattice-based method for keyword spotting in online Chinese handwriting to improve the trade-off between accuracy and speed, and to overcome the out-of-...
Heng Zhang, Cheng-Lin Liu
ICCAD
2005
IEEE
81views Hardware» more  ICCAD 2005»
16 years 1 months ago
Kauffman networks: analysis and applications
Abstract— A Kauffman network is an abstract model of gene regulatory networks. Each gene is represented by a vertex. An edge from one vertex to another implies that the former ge...
Elena Dubrova, Maxim Teslenko, Andrés Marti...