Results 1  10
of
7,399
Incremental Algorithms
, 1999
"... algorithms are designed to take advantage of incremental changes to a formal model to improve the efficiency of the reachable state space generation. This report presents incremental changes that are considered appropriate for Coloured Petri Nets and then presents and discusses some algorithms that ..."
Abstract
 Add to MetaCart
algorithms are designed to take advantage of incremental changes to a formal model to improve the efficiency of the reachable state space generation. This report presents incremental changes that are considered appropriate for Coloured Petri Nets and then presents and discusses some algorithms
Incremental algorithms for hierarchical classification
 Journal of Machine Learning Research
, 2004
"... We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce a new algorithm that incrementally learns a linearthreshold classifier for each node of the taxonomy. A hierarchical classification is obtained b ..."
Abstract

Cited by 109 (9 self)
 Add to MetaCart
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce a new algorithm that incrementally learns a linearthreshold classifier for each node of the taxonomy. A hierarchical classification is obtained
Incremental Algorithms on Lists
 Proceedings SION Computing Science in the Netherlands
, 1991
"... Incremental computations can improve the performance of interactive programs such as spreadsheet programs, program development environments, text editors, etc. Incremental algorithms describe how to compute a required value depending on the input, after the input has been edited. By considering the ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Incremental computations can improve the performance of interactive programs such as spreadsheet programs, program development environments, text editors, etc. Incremental algorithms describe how to compute a required value depending on the input, after the input has been edited. By considering
INCREMENTAL ALGORITHMS FOR LATTICE PROBLEMS
, 2006
"... ABSTRACT. In this short note we give incremental algorithms for the following lattice problems: finding a basis of a lattice, computing the successive minima, and determining the orthogonal decomposition. We prove an upper bound for the number of update steps for every insertion order. For the deter ..."
Abstract
 Add to MetaCart
ABSTRACT. In this short note we give incremental algorithms for the following lattice problems: finding a basis of a lattice, computing the successive minima, and determining the orthogonal decomposition. We prove an upper bound for the number of update steps for every insertion order
AN INCREMENTAL ALGORITHM FOR BROADCAST SCHEDULING IN
"... Packet radio networks hold great promise for providing PACKET RADIO NETWORKS easy to use, mobile military communications services. However, supporting mobility with packet radio networks poses many technical challenges. One of these challenges, to dynamically and quickly adjust schedules for fixed c ..."
Abstract
 Add to MetaCart
whenever the network topology changes (by even a single node) is unacceptable. In this situation, incremental algorithms are needed. Such algorithms accommodate topological changes by adapting the existing schedule, rather than rebuilding the schedule from scratch. The twin objectives of incremental
Meseta: A New Scheduling Strategy for Speculative Parallelization of Randomized Incremental Algorithms
 Proc. 34th Int’l Conf. Parallel Processing (ICPP ’05) Workshops, Seventh Workshop High Performance Scientific and Eng. Computing (HPSEC ’05
, 2005
"... incremental algorithms ..."
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
An Improved Incremental Algorithm for
"... This work presents an algorithm that given a generalized planar graph obtains its constrained Delaunay triangulation (CDT). The proposed method, which follows the general approach of [3], works incrementally based on two improved procedures. ..."
Abstract
 Add to MetaCart
This work presents an algorithm that given a generalized planar graph obtains its constrained Delaunay triangulation (CDT). The proposed method, which follows the general approach of [3], works incrementally based on two improved procedures.
Incremental Algorithms for Approximate Compilation
"... Abstract Compilation is an important approach to a range of inference problems, since it enables lineartime inference in the size S of the compiled representation. However, the main drawback is that S can be exponentially larger than the size of the original function. To address this issue, we pro ..."
Abstract
 Add to MetaCart
functions, without having to perform inference over the full solutionspace. We describe incremental, approximate algorithms for the prime implicant and DNNF compilation languages, and provide empirical evidence that these algorithms enable space reductions of several ordersofmagnitude over the full
Lower And Upper Bounds For Incremental Algorithms
, 1992
"... An incremental algorithm (also called a dynamic update algorithm) updates the answer to some problem after an incremental change is made in the input. We examine methods for bounding the performance of such algorithms. First, quite general but relatively weak bounds are considered, along with a care ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
An incremental algorithm (also called a dynamic update algorithm) updates the answer to some problem after an incremental change is made in the input. We examine methods for bounding the performance of such algorithms. First, quite general but relatively weak bounds are considered, along with a
Results 1  10
of
7,399