Sciweavers

4066 search results - page 41 / 814
» Almost Complete Sets
Sort
View
AMAST
2008
Springer
13 years 12 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
ICPR
2008
IEEE
14 years 4 months ago
Face recognition using Complete Fuzzy LDA
In this paper, we propose a novel method for feature extraction and recognition, namely, Complete Fuzzy LDA (CFLDA). CFLDA combines the complete LDA and fuzzy set theory. CFLDA re...
Wankou Yang, Hui Yan, Jianguo Wang, Jingyu Yang
ISPASS
2003
IEEE
14 years 3 months ago
Complete instrumentation requirements for performance analysis of Web based technologies
In this paper we present the eDragon environment, a research platform created to perform complete performance analysis of new Web-based technologies. eDragon enables the understan...
David Carrera, Jordi Guitart, Jordi Torres, Eduard...
CALCO
2009
Springer
159views Mathematics» more  CALCO 2009»
14 years 4 months ago
Complete Iterativity for Algebras with Effects
Abstract. Completely iterative algebras (cias) are those algebras in which recursive equations have unique solutions. In this paper we study complete iterativity for algebras with ...
Stefan Milius, Thorsten Palm, Daniel Schwencke
SOFSEM
2005
Springer
14 years 3 months ago
Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
Radoslav Fulek, Hongmei He, Ondrej Sýkora, ...