Sciweavers

5084 search results - page 375 / 1017
» Proving Possibility Properties
Sort
View
AI
2005
Springer
15 years 6 months ago
First order LUB approximations: characterization and algorithms
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
Alvaro del Val
STTT
2008
95views more  STTT 2008»
15 years 6 months ago
FAST: acceleration from theory to practice
Abstract. Fast is a tool for the analysis of systems manipulating unbounded integer variables. We check safety properties by computing the reachability set of the system under stud...
Sébastien Bardin, Alain Finkel, Jér&...
JAT
2007
84views more  JAT 2007»
15 years 6 months ago
On Lebesgue-type inequalities for greedy approximation
We study the efficiency of greedy algorithms with regard to redundant dictionaries in Hilbert spaces. We obtain upper estimates for the errors of the Pure Greedy Algorithm and th...
David L. Donoho, Michael Elad, Vladimir N. Temlyak...
TKDE
2008
121views more  TKDE 2008»
15 years 6 months ago
On Modularity Clustering
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
TSP
2008
87views more  TSP 2008»
15 years 6 months ago
A Proof of Convergence of the MAP Turbo-Detector to the AWGN Case
In this paper, we consider a coded transmission over a frequency selective channel. We propose to study analytically the convergence of the turbo-detector using a maximum a poster...
Noura Sellami, Aline Roumy, Inbar Fijalkow