Sciweavers

7303 search results - page 226 / 1461
» Optimality for dynamic patterns
Sort
View
CSREAESA
2006
15 years 5 months ago
Energy Optimization for Application-Specific NOC with Multi-Mode Switches
As the number of cores on a chip increases, power consumed by the communication structures takes significant portion of the overall power-budget. As technology scales to deep sub-...
Kuei-Chung Chang
ATMOS
2007
177views Optimization» more  ATMOS 2007»
15 years 5 months ago
Approximate dynamic programming for rail operations
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Warren B. Powell, Belgacem Bouzaïene-Ayari
150
Voted
EDBT
2004
ACM
155views Database» more  EDBT 2004»
16 years 4 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
PAMI
2008
166views more  PAMI 2008»
15 years 4 months ago
Robust Real-Time Pattern Matching Using Bayesian Sequential Hypothesis Testing
This paper describes a method for robust real time pattern matching. We first introduce a family of image distance measures, the "Image Hamming Distance Family". Members ...
Ofir Pele, Michael Werman
CORR
2011
Springer
198views Education» more  CORR 2011»
14 years 11 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski