Sciweavers

705 search results - page 73 / 141
» Approximating Extended Answer Sets
Sort
View
STRINGOLOGY
2004
14 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...
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
14 years 10 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
FSS
2008
126views more  FSS 2008»
14 years 8 months ago
Linguistic summarization of time series using a fuzzy quantifier driven aggregation
We propose new types of linguistic summaries of time-series data that extend those proposed in our previous papers. The proposed summaries of time series refer to the summaries of...
Janusz Kacprzyk, Anna Wilbik, Slawomir Zadrozny
CSCLP
2007
Springer
15 years 4 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
ISMIS
1994
Springer
15 years 1 months ago
Distributed Multi-Agent Probabilistic Reasoning With Bayesian Networks
Main stream approaches in distributed artificial intelligence (DAI) are essentially logic-based. Little has been reported to explore probabilistic approach in DAI. On the other han...
Yang Xiang