1419 search results - page 71 / 284 » A Characterization of Constructive Dimension |
117
click to vote
COMBINATORICS
2002
15 years 4 months ago
2002
In 1906 Axel Thue showed how to construct an infinite non-repetitive (or squarefree) word on an alphabet of size 3. Since then this result has been rediscovered many times and ext...
161
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
136
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
108
Voted
EPIA
1995
Springer
15 years 7 months ago
1995
Springer
We provide a nine-valued logic to characterize the models of logic programs under a paraconsistent well-founded semantics with explicit negation WFSX p. We define a truth-function...
140
Voted
IPCO
2007
15 years 5 months ago
2007
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...