Sciweavers

7129 search results - page 365 / 1426
» Approximation Algorithms for Treewidth
Sort
View
CPM
2000
Springer
175views Combinatorics» more  CPM 2000»
15 years 9 months ago
Approximate String Matching over Ziv-Lempel Compressed Text
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
Juha Kärkkäinen, Gonzalo Navarro, Esko U...
163
Voted
DATE
2009
IEEE
107views Hardware» more  DATE 2009»
15 years 8 months ago
Sequential logic rectifications with approximate SPFDs
In the digital VLSI cycle, logic transformations are often required to modify the design to meet different synthesis and optimization goals. Logic transformations on sequential ci...
Yu-Shen Yang, Subarna Sinha, Andreas G. Veneris, R...
WSC
2004
15 years 6 months ago
Experimental Performance Evaluation of Histogram Approximation for Simulation Output Analysis
We summarize the results of an experimental performance evaluation of using an empirical histogram to approximate the steady-state distribution of the underlying stochastic proces...
E. Jack Chen, W. David Kelton
DAM
2008
131views more  DAM 2008»
15 years 4 months ago
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
Márcia R. Cerioli, L. Faria, T. O. Ferreira...
ENTCS
2008
116views more  ENTCS 2008»
15 years 4 months ago
Phil: A Lazy Implementation of a Language for Approximate Filtering of XML Documents
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
Michele Baggi, Demis Ballis