Sciweavers

1700 search results - page 147 / 340
» Combinatorial Pattern Matching
Sort
View
FOCS
1992
IEEE
14 years 2 months ago
Quadratic Dynamical Systems (Preliminary Version)
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...
Yuri Rabinovich, Alistair Sinclair, Avi Wigderson
IPCO
2010
231views Optimization» more  IPCO 2010»
13 years 11 months ago
Branched Polyhedral Systems
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
Volker Kaibel, Andreas Loos
JAL
1998
85views more  JAL 1998»
13 years 10 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay
CDC
2010
IEEE
133views Control Systems» more  CDC 2010»
13 years 5 months ago
Decentralized task assignment in camera networks
The problem of task assignment naturally arises in multiagent multitask systems, where an optimal matching of agents and tasks is sought. This problem is a combinatorial optimizati...
Angelo Cenedese, Federico Cerruti, Mirko Fabbro, C...
STRINGOLOGY
2004
13 years 11 months ago
BDD-Based Analysis of Gapped q-Gram Filters
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
Marc Fontaine, Stefan Burkhardt, Juha Kärkk&a...