Sciweavers

823 search results - page 52 / 165
» Stateful Subset Cover
Sort
View
NJC
2006
102views more  NJC 2006»
13 years 10 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
JGT
2007
146views more  JGT 2007»
13 years 10 months ago
Compatible circuit decompositions of 4-regular graphs
A transition system T of an Eulerian graph G is a family of partitions of the edges incident to each vertex of G into transitions i.e. subsets of size two. A circuit decomposition...
Herbert Fleischner, François Genest, Bill J...
TIT
1998
63views more  TIT 1998»
13 years 9 months ago
On the Consistency of Minimum Complexity Nonparametric Estimation
— Nonparametric estimation is usually inconsistent without some form of regularization. One way to impose regularity is through a prior measure. Barron and Cover [1], [2] have sh...
Zhiyi Chi, Stuart Geman
SBMF
2010
Springer
164views Formal Methods» more  SBMF 2010»
13 years 4 months ago
A Decision Procedure for Bisimilarity of Generalized Regular Expressions
A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed ...
Marcello M. Bonsangue, Georgiana Caltais, Eugen-Io...
ICCAD
1994
IEEE
65views Hardware» more  ICCAD 1994»
14 years 2 months ago
Incremental formal design verification
Language containment is a method for design verification that involves checking if the behavior of the system to be verified is a subset of the behavior of the specifications (pro...
Gitanjali Swamy, Robert K. Brayton