Results 1  10
of
478,728
Incremental Constructions con BRIO
, 2003
"... Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns. We define a biased randomized insertion order which removes enough randomness to significantly improve performance, but ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns. We define a biased randomized insertion order which removes enough randomness to significantly improve performance
Four results on randomized incremental constructions
 Comput. Geom. Theory Appl
, 1993
"... Raimund Seidel§ We prove four results on randomized incremental constructions (RIes): • an analysis of the expected behavior under insertion and deletions, • a fully dynamic data structure for convex hull mamtenance in arbitrary dimensions, • a tail estimate for the space complexity of RIes, • a low ..."
Abstract

Cited by 112 (19 self)
 Add to MetaCart
Raimund Seidel§ We prove four results on randomized incremental constructions (RIes): • an analysis of the expected behavior under insertion and deletions, • a fully dynamic data structure for convex hull mamtenance in arbitrary dimensions, • a tail estimate for the space complexity of RIes, • a
Incremental Construction of the Hierarchical Generalized
"... This paper prescribes an incremental procedure to construct roadmaps of unknown environments. Recall that a roadmap is a geometric structure that a robot uses to plan a path between two points in an environment. If the robot knows the roadmap, then it knows the environment. Likewise, if the robot co ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper prescribes an incremental procedure to construct roadmaps of unknown environments. Recall that a roadmap is a geometric structure that a robot uses to plan a path between two points in an environment. If the robot knows the roadmap, then it knows the environment. Likewise, if the robot
Markov Incremental Constructions
, 2008
"... A classic result asserts that many geometric structures can be constructed optimally by successively inserting their constituent parts in random order. These randomized incremental constructions (RICs) still work with imperfect randomness: the dynamic operations need only be“locally”random. Much att ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
A classic result asserts that many geometric structures can be constructed optimally by successively inserting their constituent parts in random order. These randomized incremental constructions (RICs) still work with imperfect randomness: the dynamic operations need only be“locally”random. Much
On lazy randomized incremental construction
 In Proc. 26th Annu. ACM Sympos. Theory Comput
, 1994
"... We introduce a new type of randomized incremental algorithms. Contrary to standard randomized incremental algorithms, these lazy randomized incremental algorithms are suited for computing structures that have a `nonlocal' definition. In order to analyze these algorithms we generalize some resu ..."
Abstract

Cited by 35 (7 self)
 Add to MetaCart
We introduce a new type of randomized incremental algorithms. Contrary to standard randomized incremental algorithms, these lazy randomized incremental algorithms are suited for computing structures that have a `nonlocal' definition. In order to analyze these algorithms we generalize some
Randomized Incremental Construction of Compressed
, 2009
"... We present a simple randomized incremental algorithm for building compressed quadtrees. The resulting algorithm seems to be simpler than previously known algorithms for this task. 1 ..."
Abstract
 Add to MetaCart
We present a simple randomized incremental algorithm for building compressed quadtrees. The resulting algorithm seems to be simpler than previously known algorithms for this task. 1
Abstract Blocked Randomized Incremental Constructions
"... Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns. We define an insertion order which removes enough randomness to significantly improve performance, but leaves enough ra ..."
Abstract
 Add to MetaCart
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns. We define an insertion order which removes enough randomness to significantly improve performance, but leaves enough
Universal approximation using incremental constructive feedforward networks with . . .
 IEEE TRANSACTIONS ON NEURAL NETWORKS
, 2005
"... According to conventional neural network theories, singlehiddenlayer feedforward networks (SLFNs) with additive or radial basis function (RBF) hidden nodes are universal approximators when all the parameters of the networks are allowed adjustable. However, as observed in most neural network implem ..."
Abstract

Cited by 93 (15 self)
 Add to MetaCart
implementations, tuning all the parameters of the networks may cause learning complicated and inefficient, and it may be difficult to train networks with nondifferential activation functions such as threshold networks. Unlike conventional neural network theories, this paper proves in an incremental constructive
A Fast Flexible Docking Method using an Incremental Construction Algorithm
 J. Mol. Biol
, 1996
"... We present an automatic method for docking organic ligands into protein Center for Information binding sites. The method can be used in the design process of specific Technology (GMD), Institute protein ligands. It combines an appropriate model of the physicochemical for Algorithms and Scientific p ..."
Abstract

Cited by 219 (5 self)
 Add to MetaCart
We present an automatic method for docking organic ligands into protein Center for Information binding sites. The method can be used in the design process of specific Technology (GMD), Institute protein ligands. It combines an appropriate model of the physicochemical for Algorithms and Scientific properties of the docked molecules with efficient methods for sampling the Computing (SCAI), Schloß conformational space of the ligand. If the ligand is flexible, it can adopt
Incremental construction of compact acyclic NFAs
 IN PROCEEDINGS OF ACL 2001
, 2001
"... This paper presents and analyzes an incremental algorithm for the construction of Acyclic Nondeterministic Finitestate Automata (NFA). Automata of this type are quite useful in computational linguistics, especially for storing lexicons. The proposed algorithm produces compact NFAs, i.e. NFA ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
This paper presents and analyzes an incremental algorithm for the construction of Acyclic Nondeterministic Finitestate Automata (NFA). Automata of this type are quite useful in computational linguistics, especially for storing lexicons. The proposed algorithm produces compact NFAs, i
Results 1  10
of
478,728