Results 1  10
of
3,910
isomorphism and canonization problems
"... With this thesis, I would like to take you on journey to the place where the graph isomorphism problem and parametrized complexity meet. The graph isomorphism problem asks whether there is a bijection between the vertex sets of two graphs that maps edges to edges and nonedges to nonedges. Its impo ..."
Abstract
 Add to MetaCart
importance for complexity theory arises from the fact that it is neither known to be in P nor known to be NPcomplete. As the polynomial time hierarchy collapses if the graph isomorphism problem is NPcomplete [Sch88], the latter option is regarded as unlikely. As a close relative, the graph canonization
New results in linear filtering and prediction theory
 TRANS. ASME, SER. D, J. BASIC ENG
, 1961
"... A nonlinear differential equation of the Riccati type is derived for the covariance matrix of the optimal filtering error. The solution of this "variance equation " completely specifies the optimal filter for either finite or infinite smoothing intervals and stationary or nonstationary sta ..."
Abstract

Cited by 607 (0 self)
 Add to MetaCart
statistics. The variance equation is closely related to the Hamiltonian (canonical) differential equations of the calculus of variations. Analytic solutions are available in some cases. The significance of the variance equation is illustrated by examples which duplicate, simplify, or extend earlier results
Children in the Forest: Towards a Canonical Problem of SpatioTemporal Collaboration
"... Canonical problems are simplified representations of a class of real world problems. They allow researchers to compare algorithms in a standard setting which captures the most important challenges of the real world problems being modeled. Such examples are the block world for planning, twoplayer ga ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Canonical problems are simplified representations of a class of real world problems. They allow researchers to compare algorithms in a standard setting which captures the most important challenges of the real world problems being modeled. Such examples are the block world for planning, two
Data Exchange: Semantics and Query Answering
 In ICDT
, 2003
"... Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema that reflects the source data as accurately as possible. In this paper, we address foundational and algorithmic issues related to the semantics of data exchange and to query answe ..."
Abstract

Cited by 427 (41 self)
 Add to MetaCart
to compute a canonical universal solution efficiently. We adopt the notion of "certain answers" in indefinite databases for the semantics for query answering in data exchange. We investigate the computational complexity of computing the certain answers in this context and also study the problem
Erdős Graphs Resolve Fine's Canonicity Problem
 THE BULLETIN OF SYMBOLIC LOGIC
, 2003
"... We show that there exist 2^ℵ0 equational classes of Boolean algebras with operators that are not generated by the complex algebras of any firstorder definable class of relational structures. Using a variant of this construction, we resolve a longstanding question of Fine, by exhibiting ..."
Abstract

Cited by 16 (8 self)
 Add to MetaCart
, by exhibiting a bimodal logic that is valid in its canonical frames, but is not sound and complete for any firstorder definable class of Kripke frames. The constructions use the result of Erdős that there are finite graphs with arbitrarily large chromatic number and girth.
Frequent Subgraph Discovery
, 2001
"... Over the years, frequent itemset discovery algorithms have been used to solve various interesting problems. As data mining techniques are being increasingly applied to nontraditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the requirement of th ..."
Abstract

Cited by 406 (10 self)
 Add to MetaCart
transactions and it is able to discover frequent subgraphs from a set of graph transactions reasonably fast, even though we have to deal with computationally hard problems such as canonical labeling of graphs and subgraph isomorphism which are not necessary for traditional frequent itemset discovery.
A computer program for a canonical problem in underwater shock. Shock and Vibration
, 1994
"... Finite ..."
A “canonical ” problem: Local Event Detection and Data Propagation
, 2013
"... p, senses a local event E. The general propagation problem is the following: “How can sensor p, via cooperation with the rest of the sensors in the network, propagate information about event E to the control center?” 2 / 35. Representative data propagation protocols • Directed Diffusion (DD): a tree ..."
Abstract
 Add to MetaCart
p, senses a local event E. The general propagation problem is the following: “How can sensor p, via cooperation with the rest of the sensors in the network, propagate information about event E to the control center?” 2 / 35. Representative data propagation protocols • Directed Diffusion (DD): a
ANALYSIS OF MULTISCALE METHODS
, 2004
"... The heterogeneous multiscale method gives a general framework for the analysis of multiscale methods. In this paper, we demonstrate this by applying this framework to two canonical problems: The elliptic problem with multiscale coefficients and the quasicontinuum method. ..."
Abstract

Cited by 277 (32 self)
 Add to MetaCart
The heterogeneous multiscale method gives a general framework for the analysis of multiscale methods. In this paper, we demonstrate this by applying this framework to two canonical problems: The elliptic problem with multiscale coefficients and the quasicontinuum method.
Results 1  10
of
3,910