Sciweavers

9176 search results - page 350 / 1836
» algorithms 2010
Sort
View
AAAI
2010
15 years 8 months ago
Filtering Bounded Knapsack Constraints in Expected Sublinear Time
We present a highly efficient incremental algorithm for propagating bounded knapsack constraints. Our algorithm is based on the sublinear filtering algorithm for binary knapsack c...
Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
15 years 1 months ago
Multi-resolution path planning: Theoretical analysis, efficient implementation, and extensions to dynamic environments
A multi-resolution path planning algorithm based on the wavelet transform of the environment has been reported previously in the literature. In this paper, we provide a proof of co...
Raghvendra V. Cowlagi, Panagiotis Tsiotras
COLING
2010
15 years 1 months ago
Text Summarization of Turkish Texts using Latent Semantic Analysis
Text summarization solves the problem of extracting important information from huge amount of text data. There are various methods in the literature that aim to find out well-form...
Makbule Ozsoy, Ilyas Cicekli, Ferda Nur Alpaslan
CORR
2010
Springer
102views Education» more  CORR 2010»
15 years 6 months ago
On Flat Polyhedra deriving from Alexandrov's Theorem
We show that there is a straightforward algorithm to determine if the polyhedron guaranteed to exist by Alexandrov's gluing theorem is a degenerate flat polyhedron, and to re...
Joseph O'Rourke
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 6 months ago
Quantization of Discrete Probability Distributions
We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this probl...
Yuriy A. Reznik