Results 1 - 10 of 927

Inducing Features of Random Fields

by Stephen Della Pietra, Vincent Della Pietra, John Lafferty - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1997
"... We present a technique for constructing random fields from a set of training samples. The learning paradigm builds increasingly complex fields by allowing potential functions, or features, that are supported by increasingly large subgraphs. Each feature has a weight that is trained by minimizing the ..."
Abstract - Cited by 670 (10 self) - Add to MetaCart
introduced in this paper differ from those common to much of the computer vision literature in that the underlying random fields are non-Markovian and have a large number of parameters that must be estimated. Relations to other learning approaches, including decision trees, are given. As a demonstration

Incremental Distance Join Algorithms for Spatial Databases

by Gisli Hjaltason , Hanan Samet , 1998
"... Two new spatial join operations, distance join and distance semijoin, are introduced where the join output is ordered by the distance between the spatial attribute values of the joined tuples. Incremental algorithms are presented for computing these operations, which can be used in a pipelined fashi ..."
Abstract - Cited by 145 (12 self) - Add to MetaCart
study using Rtrees shows that the incremental algorithms outperform non-incremental approaches by an order of magnitude if only a small part of the result is needed, while the penalty, if any, for the incremental processing is modest if the entire join result is required.

A path independent integral and the approximate analysis of strain concentration by notches and cracks

by James R. Rice , 1967
"... An integral is exhibited which has the same value for all paths surrounding a class of notches in two-dimensional deformation fields of linear or non-linear elastic materials. The integral may be evaluated almost by inspection for a few notch configurations. Also, for materials of the elastic-plasti ..."
Abstract - Cited by 419 (11 self) - Add to MetaCart
-plastic type (treated through a deformation rather than incremental formulation), with a linear re-sponse to small stresses followed by non-linear yielding, the integral may be evaluated in terms of Irwin's stress intensity factor when yielding occurs on a scale small in comparison to notch size

A Non-Incremental Computational Strategy for Plastic or Viscoplastic Structures with Unilateral Contact

by S. Idelsohn, E. Oñate, E. Dvorkin (eds, Laurent Champaney, Pierre Ladevèze, Patrick Talbot , 1998
"... . This paper presents a non-incremental computational strategy which is dedicated to the analysis of complex situations of 3D assemblages of plastic or viscoplastic structures, including numerous frictional contact connections. It is based on a decomposition of the assemblage into substructures and ..."
Abstract - Add to MetaCart
. This paper presents a non-incremental computational strategy which is dedicated to the analysis of complex situations of 3D assemblages of plastic or viscoplastic structures, including numerous frictional contact connections. It is based on a decomposition of the assemblage into substructures

Incremental Evolution of Robot Controllers for a Highly Integrated Task

by Anders Lyhne Christensen, Marco Dorigo - Proceedings of The Ninth International Conference on the Simulation of Adaptive Behavior SAB'06
"... Abstract. In this paper we apply incremental evolution for automatic synthesis of neural network controllers for a group of physically connected mobile robots called s-bots. The robots should be able to safely and cooperatively perform phototaxis in an arena containing holes. We experiment with two ..."
Abstract - Cited by 8 (3 self) - Add to MetaCart
approaches to incremental evolution, namely behavioral decomposition and environmental complexity increase. Our results are compared with results obtained in a previous study where several non-incremental evolutionary algorithms were tested and in which the evolved controllers were shown to transfer

Incremental control synthesis in probabilistic environments with temporal logic constraints

by Alphan Ulusoy , Tichakorn Wongpiromsarn , Calin Belta - In Proc. of 51st IEEE Conf. on Decision and Control (CDC , 2012
"... Abstract-In this paper, we present a method for optimal control synthesis of a plant that interacts with a set of agents in a graph-like environment. The control specification is given as a temporal logic statement about some properties that hold at the vertices of the environment. The plant is ass ..."
Abstract - Cited by 7 (2 self) - Add to MetaCart
that temporal logic verification is computationally cheaper than synthesis. We present a case-study where we compare our approach to the classical non-incremental approach in terms of computation time and memory usage.

Abstract Incremental Distance Join Algorithms for Spatial Databases

by unknown authors
"... Two new spatial join operations, distance join and distance semijoin, are introduced where the join output is ordered by the distance between the spatial attribute values of the joined tuples. Incremental algorithms are presented for computing these operations, which can be used in a pipelined fashi ..."
Abstract - Add to MetaCart
study using Rtrees shows that the incremental algorithms outperform non-incremental approaches by an order of magnitude if only a small part of the result is needed, while the penalty, if any, for the incremental processing is modest if the entire join result is required. 1

Issues in Evolutionary Robotics

by I. Harvey, P. Husbands, D. Cliff , 1992
"... In this paper we propose and justify a methodology for the development of the control systems, or `cognitive architectures', of autonomous mobile robots. We argue that the design by hand of such control systems becomes prohibitively difficult as complexity increases. We discuss an alternative a ..."
Abstract - Cited by 272 (33 self) - Add to MetaCart
approach, involving artificial evolution, where the basic building blocks for cognitive architectures are adaptive noise-tolerant dynamical neural networks, rather than programs. These networks may be recurrent, and should operate in real time. Evolution should be incremental, using an extended

Stable structure from motion for unordered image collections

by Carl Olsson, Olof Enqvist - in Proceedings of the 17th Scandinavian conference on Image analysis, ser. SCIA’11 , 2011
"... Abstract. We present a non-incremental approach to structure from motion. Our solution is based on robustly computing global rotations from relative geometries and feeding these into the known-rotation framework to create an initial solution for bundle adjustment. To increase robustness we present a ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
Abstract. We present a non-incremental approach to structure from motion. Our solution is based on robustly computing global rotations from relative geometries and feeding these into the known-rotation framework to create an initial solution for bundle adjustment. To increase robustness we present

An Algorithm for Multi-way Distance Join Query

by Yin Liang, Hong Zhang
"... Abstract-This paper presents K-DJQ algorithms for solving multi-way distance join query, which finds the K n-tuples from n spatial datasets that have the smallest distance value according to query graph. R-tree is used as index structure for each dataset. K-DJQ algorithm is recursive non-incremental ..."
Abstract - Add to MetaCart
Abstract-This paper presents K-DJQ algorithms for solving multi-way distance join query, which finds the K n-tuples from n spatial datasets that have the smallest distance value according to query graph. R-tree is used as index structure for each dataset. K-DJQ algorithm is recursive non-incremental
Results 1 - 10 of 927