Sciweavers

4 search results - page 1 / 1
» Cardinal sequences of LCS spaces under GCH
Sort
View
APAL
2010
69views more  APAL 2010»
13 years 4 months ago
Cardinal sequences of LCS spaces under GCH
Let C() denote the class of all cardinal sequences of length associated with compact scattered spaces. Also put C() = {f C() : f(0) = = min[f() : < ]}. If is a cardinal an...
Juan Carlos Martinez, Lajos Soukup
CPM
2004
Springer
86views Combinatorics» more  CPM 2004»
13 years 8 months ago
Two Algorithms for LCS Consecutive Suffix Alignment
The problem of comparing two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence...
Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson
AAAI
2004
13 years 6 months ago
Distance Estimates for Planning in the Discrete Belief Space
We present a general framework for studying heuristics for planning in the belief space. Earlier work has focused on giving implementations of heuristics that work well on benchma...
Jussi Rintanen
ICC
2007
IEEE
124views Communications» more  ICC 2007»
13 years 11 months ago
Iterative Interference Suppression for High-Rate Single-Carrier Space-Time Block-Coded CDMA
—In this paper, we employ time-reversal space-time block coding (TR-STBC) in single-carrier direct sequence codedivision multiple access (DS-CDMA) block transmission in the prese...
Der-Feng Tseng, Wei-Yu Lai, Tzung-Ru Tsai