2128 search results - page 137 / 426 » A general characterization of indulgence |
124
click to vote
FCT
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. Given a subset S of N, filtering a word a0a1 · · · an by S consists in deleting the letters ai such that i is not in S. By a natural generalization, denote by L[S], w...
140
click to vote
ICC
2000
IEEE
15 years 9 months ago
2000
IEEE
—Noncoherent sequence detection algorithms, recently proposed by the authors, have a performance which approaches that of coherent detectors and are robust to phase and frequency...
148
click to vote
FCT
1999
Springer
15 years 9 months ago
1999
Springer
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...
132
click to vote
PODS
1997
ACM
15 years 9 months ago
1997
ACM
We consider the problem of indexing general database workloads (combinations of data sets and sets of potential queries). We de ne a framework for measuring the eciency of an ind...
173
click to vote
GFKL
2007
Springer
15 years 8 months ago
2007
Springer
Kernel methods offer a flexible toolbox for pattern analysis and machine learning. A general class of kernel functions which incorporates known pattern invariances are invariant d...