Results 1  10
of
332
Compressed fulltext indexes
 ACM COMPUTING SURVEYS
, 2007
"... Fulltext indexes provide fast substring search over large text collections. A serious problem of these indexes has traditionally been their space consumption. A recent trend is to develop indexes that exploit the compressibility of the text, so that their size is a function of the compressed text l ..."
Abstract

Cited by 263 (94 self)
 Add to MetaCart
(Show Context)
Fulltext indexes provide fast substring search over large text collections. A serious problem of these indexes has traditionally been their space consumption. A recent trend is to develop indexes that exploit the compressibility of the text, so that their size is a function of the compressed text length. This concept has evolved into selfindexes, which in addition contain enough information to reproduce any text portion, so they replace the text. The exciting possibility of an index that takes space close to that of the compressed text, replaces it, and in addition provides fast search over it, has triggered a wealth of activity and produced surprising results in a very short time, and radically changed the status of this area in less than five years. The most successful indexes nowadays are able to obtain almost optimal space and search time simultaneously. In this paper we present the main concepts underlying selfindexes. We explain the relationship between text entropy and regularities that show up in index structures and permit compressing them. Then we cover the most relevant selfindexes up to date, focusing on the essential aspects on how they exploit the text compressibility and how they solve efficiently various search problems. We aim at giving the theoretical background to understand and follow the developments in this area.
The message delay in mobile ad hoc networks
, 2005
"... A stochastic model is introduced that accurately models the message delay in mobile ad hoc networks where nodes relay messages and the networks are sparsely populated. The model has only two input parameters: the number of nodes and the parameter of an exponential distribution which describes the ti ..."
Abstract

Cited by 140 (5 self)
 Add to MetaCart
A stochastic model is introduced that accurately models the message delay in mobile ad hoc networks where nodes relay messages and the networks are sparsely populated. The model has only two input parameters: the number of nodes and the parameter of an exponential distribution which describes the time until two random mobiles come within communication range of one another. Closedform expressions are obtained for the Laplace–Stieltjes transform of the message delay, defined as the time needed to transfer a message between a source and a destination. From this we derive both a closedform expression and an asymptotic approximation (as a function of the number of nodes) of the expected message delay. As an additional result, the probability distribution function is obtained for the number of copies of the message at the time the message is delivered. These calculations are carried out for two protocols: the twohop multicopy and the unrestricted multicopy protocols. It is shown that despite its simplicity, the model accurately predicts the message delay for both relay strategies for a number of mobility models (the random waypoint, random direction and the random walker mobility models).
Size fair and homologous tree genetic programming crossovers. Genetic Programming And Evolvable Machines
"... Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program size and no detrimental e ect on GP performance. GP search spaces are partitioned by the ridge in the number of program v. their si ..."
Abstract

Cited by 88 (22 self)
 Add to MetaCart
(Show Context)
Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program size and no detrimental e ect on GP performance. GP search spaces are partitioned by the ridge in the number of program v. their size and depth. A ramped uniform random initialisation is described which straddles the ridge. With subtree crossover trees increase about one level per generation leading to subquadratic bloat in length. 1
Basic Analytic Combinatorics of Directed Lattice Paths
 Theoretical Computer Science
, 2001
"... This paper develops a unified enumerative and asymptotic theory of directed 2dimensional lattice paths in halfplanes and quarterplanes. The lattice paths are speci ed by a finite set of rules that are both time and space homogeneous, and have a privileged direction of increase. (They are then ess ..."
Abstract

Cited by 78 (13 self)
 Add to MetaCart
(Show Context)
This paper develops a unified enumerative and asymptotic theory of directed 2dimensional lattice paths in halfplanes and quarterplanes. The lattice paths are speci ed by a finite set of rules that are both time and space homogeneous, and have a privileged direction of increase. (They are then essentially 1dimensional objects.) The theory relies on a specific "kernel method" that provides an important decomposition of the algebraic generating functions involved, as well as on a generic study of singularities of an associated algebraic curve. Consequences are precise computable estimates for the number of lattice paths of a given length under various constraints (bridges, excursions, meanders) as well as a characterization of the limit laws associated to several basic parameters of paths.
Global Constraints as Graph Properties on Structured Network of Elementary Constraints of the Same Type
, 2000
"... This report introduces a classification scheme for the global constraints. This classification is based on four basic ingredients from which one can generate almost all existing global constraints and come up with new interesting constraints. Global constraints are defined in a very concise way, in ..."
Abstract

Cited by 75 (11 self)
 Add to MetaCart
This report introduces a classification scheme for the global constraints. This classification is based on four basic ingredients from which one can generate almost all existing global constraints and come up with new interesting constraints. Global constraints are defined in a very concise way, in term of graph properties that have to hold, where the graph is a structured network of same elementary constraints. Since this classification is based on the internal structure of the global constraints it is also a strong hint for the pruning algorithms of the global constraints. Keywords Constraint, finite domain, global constraint, classification, resource constraint scheduling, graph partitioning, timetabling. 2 Table of contents Table of contents ....................................................................................................................................................... 2 Table of figures.........................................................................
Scheduling Split Intervals
, 2002
"... We consider the problem of scheduling jobs that are given as groups of nonintersecting segments on the real line. Each job Jj is associated with an interval, Ij, which consists of up to t segments, for some t _) 1, a of their segments intersect. Such jobs show up in a I.I Problem Statement and Mo ..."
Abstract

Cited by 63 (5 self)
 Add to MetaCart
We consider the problem of scheduling jobs that are given as groups of nonintersecting segments on the real line. Each job Jj is associated with an interval, Ij, which consists of up to t segments, for some t _) 1, a of their segments intersect. Such jobs show up in a I.I Problem Statement and Motivation. We wide range of applications, including the transmission consider the problem of scheduling jobs that are given of continuousmedia data, allocation of linear resources as groups of nonintersecting segments on the real line. (e.g. bandwidth in linear processor arrays), and in Each job Jj is associated with a tinterval, Ij, which