Results 1  10
of
6,786,317
Reversal Distances for Strings with Few Blocks or Small Alphabets
"... Abstract. We study the String Reversal Distance problem, an extension of the wellknown Sorting by Reversals problem. String Reversal Distance takes two strings S and T as input, and asks for a minimum number of reversals to obtain T from S. We consider four variants: String Reversal Distance, St ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
parameters of the input strings: the number of blocks they contain (a block being maximal substring such that all letters in the substring are equal), and the alphabet size Σ. For instance, we show that Signed String Reversal Distance and Signed String Prefix Reversal Distance are NPhard even if the input
String theory and noncommutative geometry
 JHEP
, 1999
"... We extend earlier ideas about the appearance of noncommutative geometry in string theory with a nonzero Bfield. We identify a limit in which the entire string dynamics is described by a minimally coupled (supersymmetric) gauge theory on a noncommutative space, and discuss the corrections away from ..."
Abstract

Cited by 801 (8 self)
 Add to MetaCart
We extend earlier ideas about the appearance of noncommutative geometry in string theory with a nonzero Bfield. We identify a limit in which the entire string dynamics is described by a minimally coupled (supersymmetric) gauge theory on a noncommutative space, and discuss the corrections away from
A Guided Tour to Approximate String Matching
 ACM COMPUTING SURVEYS
, 1999
"... We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining t ..."
Abstract

Cited by 584 (38 self)
 Add to MetaCart
We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining
Hierarchies from Fluxes in String Compactifications
, 2002
"... Warped compactifications with significant warping provide one of the few known mechanisms for naturally generating large hierarchies of physical scales. We demonstrate that this mechanism is realizable in string theory, and give examples involving orientifold compactifications of IIB string theory a ..."
Abstract

Cited by 724 (33 self)
 Add to MetaCart
Warped compactifications with significant warping provide one of the few known mechanisms for naturally generating large hierarchies of physical scales. We demonstrate that this mechanism is realizable in string theory, and give examples involving orientifold compactifications of IIB string theory
Suffix arrays: A new method for online string searches
, 1991
"... A new and conceptually simple data structure, called a suffix array, for online string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to a sort and search paradigm that employs novel algorithms. The main advantage of suffix arrays over suffix trees is that ..."
Abstract

Cited by 827 (0 self)
 Add to MetaCart
in some cases slightly better than) suffix trees. The only drawback is that in those instances where the underlying alphabet is finite and small, suffix trees can be constructed in O(N) time in the worst case, versus O(N log N) time for suffix arrays. However, we give an augmented algorithm that
KodairaSpencer theory of gravity and exact results for quantum string amplitudes
 Commun. Math. Phys
, 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract

Cited by 545 (60 self)
 Add to MetaCart
We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a
Adhoc OnDemand Distance Vector Routing
 IN PROCEEDINGS OF THE 2ND IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS
, 1997
"... An adhoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In this paper we present Adhoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such adhoc n ..."
Abstract

Cited by 3167 (15 self)
 Add to MetaCart
An adhoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In this paper we present Adhoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad
ChernSimons Gauge Theory as a String Theory
, 2003
"... Certain two dimensional topological field theories can be interpreted as string theory backgrounds in which the usual decoupling of ghosts and matter does not hold. Like ordinary string models, these can sometimes be given spacetime interpretations. For instance, threedimensional ChernSimons gaug ..."
Abstract

Cited by 551 (14 self)
 Add to MetaCart
Certain two dimensional topological field theories can be interpreted as string theory backgrounds in which the usual decoupling of ghosts and matter does not hold. Like ordinary string models, these can sometimes be given spacetime interpretations. For instance, threedimensional Chern
Iterative decoding of binary block and convolutional codes
 IEEE Trans. Inform. Theory
, 1996
"... Abstract Iterative decoding of twodimensional systematic convolutional codes has been termed “turbo ” (de)coding. Using loglikelihood algebra, we show that any decoder can he used which accepts soft inputsincluding a priori valuesand delivers soft outputs that can he split into three terms: the ..."
Abstract

Cited by 600 (43 self)
 Add to MetaCart
: the soft channel and a priori inputs, and the extrinsic value. The extrinsic value is used as an a priori value for the next iteration. Decoding algorithms in the loglikelihood domain are given not only for convolutional codes hut also for any linear binary systematic block code. The iteration
Results 1  10
of
6,786,317