Sciweavers

20066 search results - page 340 / 4014
» T Spaces
Sort
View
JCB
2008
122views more  JCB 2008»
15 years 6 months ago
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
Enno Ohlebusch, Stefan Kurtz
CORR
2007
Springer
108views Education» more  CORR 2007»
15 years 6 months ago
Noncoherent Low-Decoding-Complexity Space-Time Codes for Wireless Relay Networks
— The differential encoding/decoding setup introduced by Kiran et al, Oggier et al and Jing et al for wireless relay networks that use codebooks consisting of unitary matrices is...
G. Susinder Rajan, B. Sundar Rajan
JSAT
2008
80views more  JSAT 2008»
15 years 6 months ago
Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis
We analyze, in this work, the performance of a recently introduced weighted Max-SAT solver, Clone, in the Max-SAT evaluation 2007. Clone utilizes a novel bound computation based o...
Knot Pipatsrisawat, Akop Palyan, Mark Chavira, Art...
MSCS
2006
54views more  MSCS 2006»
15 years 6 months ago
Quasi-metric spaces and point-free geometry
nded abstract of a paper published on Math. Struct. in Comp. Science, 16 (2006) 115-137) Anna Di Concilio and Giangiacomo Gerla Dipartimento di Matematica e Informatica, Via Ponte...
Anna Di Concilio, Giangiacomo Gerla
SIAMJO
2008
112views more  SIAMJO 2008»
15 years 6 months ago
Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern Search for constrained n...
Charles Audet, J. E. Dennis, Sébastien Le D...