Results 11  20
of
708,239
The Impact of DHT Routing Geometry on Resilience and Proximity
, 2003
"... The various proposed DHT routing algorithms embody several different underlying routing geometries. These geometries include hypercubes, rings, treelike structures, and butterfly networks. In this paper we focus on how these basic geometric approaches affect the resilience and proximity properties ..."
Abstract

Cited by 286 (4 self)
 Add to MetaCart
The various proposed DHT routing algorithms embody several different underlying routing geometries. These geometries include hypercubes, rings, treelike structures, and butterfly networks. In this paper we focus on how these basic geometric approaches affect the resilience and proximity properties
Strongly Typed Genetic Programming
 Evolutionary Computation
, 1994
"... Genetic programming is a powerful method for automatically generating computer programs via the process of natural selection [Koza 92]. However, it has the limitation known as "closure", i.e. that all the variables, constants, arguments for functions, and values returned from functions m ..."
Abstract

Cited by 278 (1 self)
 Add to MetaCart
such value be specified beforehand. This allows the initialization process and the genetic operators to only generate syntactically correct parse trees. Key concepts for STGP are generic functions, which are not true strongly typed functions but rather templates for classes of such functions, and generic
A Tutorial on (Co)Algebras and (Co)Induction
 EATCS Bulletin
, 1997
"... . Algebraic structures which are generated by a collection of constructors like natural numbers (generated by a zero and a successor) or finite lists and trees are of wellestablished importance in computer science. Formally, they are initial algebras. Induction is used both as a definition pr ..."
Abstract

Cited by 270 (36 self)
 Add to MetaCart
. Algebraic structures which are generated by a collection of constructors like natural numbers (generated by a zero and a successor) or finite lists and trees are of wellestablished importance in computer science. Formally, they are initial algebras. Induction is used both as a definition
Generating Accurate Rule Sets Without Global Optimization
 IN: PROC. OF THE 15TH INT. CONFERENCE ON MACHINE LEARNING
, 1998
"... The two dominant schemes for rulelearning, C4.5 and RIPPER, both operate in two stages. First they induce an initial rule set and then they refine it using a rather complex optimization stage that discards (C4.5) or adjusts (RIPPER) individual rules to make them work better together. In contrast, t ..."
Abstract

Cited by 269 (7 self)
 Add to MetaCart
The two dominant schemes for rulelearning, C4.5 and RIPPER, both operate in two stages. First they induce an initial rule set and then they refine it using a rather complex optimization stage that discards (C4.5) or adjusts (RIPPER) individual rules to make them work better together. In contrast
Orbihedra Of Nonpositive Curvature
 Progress in Mathematics
, 1995
"... . A 2dimensional orbihedron of nonpositive curvature is a pair (X; \Gamma), where X is a 2dimensional simplicial complex with a piecewise smooth metric such that X has nonpositive curvature in the sense of Alexandrov and Busemann and \Gamma is a group of isometries of X which acts properly disc ..."
Abstract

Cited by 250 (10 self)
 Add to MetaCart
discontinuously and cocompactly. By analogy with Riemannian manifolds of nonpositive curvature we introduce a natural notion of rank 1 for (X; \Gamma) which turns out to depend only on \Gamma and prove that, if X is boundaryless, then either (X; \Gamma) has rank 1, or X is the product of two trees, or X is a
Extracting paraphrases from a parallel corpus
 In Proc. of the ACL/EACL
, 2001
"... While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semiautomatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple English translations of th ..."
Abstract

Cited by 252 (6 self)
 Add to MetaCart
While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semiautomatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple English translations of the same source text. Our approach yields phrasal and single word lexical paraphrases as well as syntactic paraphrases. 1
View from the top: hierarchies and reverse hierarchies in the visual system
 NEURON
, 2002
"... We propose that explicit vision advances in reverse hierarchical direction, as shown for perceptual learning. Processing along the feedforward hierarchy of areas, leading to increasingly complex representations, is automatic and implicit, while conscious perception begins at the hierarchy’s top, g ..."
Abstract

Cited by 232 (4 self)
 Add to MetaCart
, gradually returning downward as needed. Thus, our initial conscious percept—vision at a glance—matches a highlevel, generalized, categorical scene interpretation, identifying “forest before trees.” For later vision with scrutiny, reverse hierarchy routines focus attention to specific, active, low
Likelihoodbased tests of topologies in phylogenetics. Syst. Biol
, 2000
"... Abstract.—Likelihoodbased statistical tests of competing evolutionary hypotheses (tree topologies) have been available for approximately a decade. By far the most commonly used is the Kishino–Hasegawa test. However, the assumptions that have to be made to ensure the validity of the Kishino–Hasegawa ..."
Abstract

Cited by 225 (3 self)
 Add to MetaCart
two topologically distinct phylogenetic trees representing hypotheses that might explain particular aligned sequence data sets. The method initially was introduced to compute con�dence intervals on posterior probabilities for topologies in a
BOAT  Optimistic Decision Tree Construction
, 1999
"... Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model that can be used to predict the class label of future, unlabeled records. A very popular class of classifiers are decision ..."
Abstract

Cited by 118 (2 self)
 Add to MetaCart
. BOAT constructs several levels of the tree in only two scans over the training database, resulting in an average performance gain of 300% over previous work. The key to this performance improvement is a novel optimistic approach to tree construction in which we construct an initial tree using a small
An optimal and progressive algorithm for skyline queries
 In SIGMOD
, 2003
"... The skyline of a set of ddimensional points contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerable attention in the database community, especially for progressive (or online) algorithms that can quickly return the firs ..."
Abstract

Cited by 225 (16 self)
 Add to MetaCart
the first skyline points without having to read the entire data file. Currently, the most efficient algorithm is NN (nearest neighbors), which applies the divideandconquer framework on datasets indexed by Rtrees. Although NN has some desirable features (such as high speed for returning the initial skyline
Results 11  20
of
708,239