Results 1  10
of
1,349
Learning generative visual models from few training examples: an incremental Bayesian approach tested on 101 object categories
, 2004
"... Abstract — Current computational approaches to learning visual object categories require thousands of training images, are slow, cannot learn in an incremental manner and cannot incorporate prior information into the learning process. In addition, no algorithm presented in the literature has been te ..."
Abstract

Cited by 784 (16 self)
 Add to MetaCart
are learnt incrementally in a Bayesian manner. Our incremental algorithm is compared experimentally to an earlier batch Bayesian algorithm, as well as to one based on maximumlikelihood. The incremental and batch versions have comparable classification performance on small training sets, but incremental
Adapting Bias by Gradient Descent: An Incremental Version of DeltaBarDelta
 In Proceeding of Tenth National Conference on Artificial Intelligence AAAI92
"... Appropriate bias is widely viewed as the key to efficient learning and generalization. I present a new algorithm, the Incremental DeltaBarDelta (IDBD) algorithm, for the learning of appropriate biases based on previous learning experience. The IDBD algorithm is developed for the case of a simple, ..."
Abstract

Cited by 92 (6 self)
 Add to MetaCart
Appropriate bias is widely viewed as the key to efficient learning and generalization. I present a new algorithm, the Incremental DeltaBarDelta (IDBD) algorithm, for the learning of appropriate biases based on previous learning experience. The IDBD algorithm is developed for the case of a simple
Color indexing
 International Journal of Computer Vision
, 1991
"... Computer vision is embracing a new research focus in which the aim is to develop visual skills for robots that allow them to interact with a dynamic, realistic environment. To achieve this aim, new kinds of vision algorithms need to be developed which run in real time and subserve the robot's g ..."
Abstract

Cited by 1636 (26 self)
 Add to MetaCart
fast incremental version of Histogram Intersection, which allows realtime indexing into a large database of stored models. For solving the location problem it introduces an algorithm called Histogram Backprojection, which performs this task efficiently in crowded scenes. 1
MULTILISP: a language for concurrent symbolic computation
 ACM Transactions on Programming Languages and Systems
, 1985
"... Multilisp is a version of the Lisp dialect Scheme extended with constructs for parallel execution. Like Scheme, Multilisp is oriented toward symbolic computation. Unlike some parallel programming languages, Multilisp incorporates constructs for causing side effects and for explicitly introducing par ..."
Abstract

Cited by 529 (1 self)
 Add to MetaCart
Multilisp is a version of the Lisp dialect Scheme extended with constructs for parallel execution. Like Scheme, Multilisp is oriented toward symbolic computation. Unlike some parallel programming languages, Multilisp incorporates constructs for causing side effects and for explicitly introducing
Incremental A*
 In Proceedings of the Neural Information Processing Systems
, 2002
"... Incremental search techniques find optimal solutions to series of similar search tasks much faster than is possible by solving each search task from scratch. While researchers have developed incremental versions of uninformed search methods, we develop an incremental version of A*. ..."
Abstract

Cited by 39 (17 self)
 Add to MetaCart
Incremental search techniques find optimal solutions to series of similar search tasks much faster than is possible by solving each search task from scratch. While researchers have developed incremental versions of uninformed search methods, we develop an incremental version of A*.
View Maintenance in a Warehousing Environment
 IN PROCEEDINGS OF SIGMOD
, 1995
"... A warehouse is a repository of integrated information drawn from remote data sources. Since a warehouse effectively implements materialized views, we must maintain the views as the data sources are updated. This view maintenance problem differs from the traditional one in that the view definition an ..."
Abstract

Cited by 295 (23 self)
 Add to MetaCart
and the base data are now decoupled. We show that this decoupling can result in anomalies if traditional algorithms are applied. Weintroduce a new algorithm, ECA (for "Eager Compensating Algorithm"), that eliminates the anomalies. ECA is based on previous incremental view maintenance algorithms
Incremental Flow
, 2005
"... This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that build on each other incrementally. Thus far, incremental problems considered in the literature have been built on NPcomplete ..."
Abstract
 Add to MetaCart
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that build on each other incrementally. Thus far, incremental problems considered in the literature have been built on NP
Issues in Evolutionary Robotics
, 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 noisetolerant dynamical neural networks, rather than programs. These networks may be recurrent, and should operate in real time. Evolution should be incremental, using an extended
Incremental Regression Testing
, 1993
"... The purpose of regression testing is to ensure that bug fixes and new functionality introduced in a new version of a software do not adversely affect the correct functionality inherited from the previous version. This paper explores efficient methods of selecting small subsets of regression test set ..."
Abstract

Cited by 107 (2 self)
 Add to MetaCart
The purpose of regression testing is to ensure that bug fixes and new functionality introduced in a new version of a software do not adversely affect the correct functionality inherited from the previous version. This paper explores efficient methods of selecting small subsets of regression test
An Incremental Algorithm for a Generalization of the ShortestPath Problem
, 1992
"... The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract

Cited by 139 (1 self)
 Add to MetaCart
subsumes the problem of finding optimal hyperpaths in directed hypergraphs (under varying optimization criteria) that has received attention recently. In this paper we present an incremental algorithm for a version of the grammar problem. As a special case of this algorithm we obtain an efficient
Results 1  10
of
1,349