Sciweavers

2836 search results - page 274 / 568
» Parsing Algorithms and Metrics
Sort
View
ANTS
1994
Springer
92views Algorithms» more  ANTS 1994»
15 years 8 months ago
The complexity of greatest common divisor computations
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
Bohdan S. Majewski, George Havas
ICPR
2010
IEEE
15 years 6 months ago
Entropy Estimation and Multi-Dimensional Scale Saliency
In this paper we survey two multi-dimensional Scale Saliency approaches based on graphs and the k-d partition algorithm. In the latter case we introduce a new divergence metric an...
Pablo Suau, Francisco Escolano
ALENEX
2010
161views Algorithms» more  ALENEX 2010»
15 years 5 months ago
Route Planning with Flexible Objective Functions
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
Robert Geisberger, Moritz Kobitzsch, Peter Sanders
128
Voted
AAAI
2000
15 years 5 months ago
Execution of Temporal Plans with Uncertainty
Simple Temporal Networks (STNs) have proved useful in applications that involve metric time. However, many applications involve events whose timing is uncertain in the sense that ...
Paul H. Morris, Nicola Muscettola
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 4 months ago
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
D. Leventhal, A. S. Lewis