Sciweavers

1068 search results - page 113 / 214
» For completeness, sublogarithmic space is no space
Sort
View
IANDC
2006
86views more  IANDC 2006»
13 years 8 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
IANDC
2007
132views more  IANDC 2007»
13 years 8 months ago
An automata-theoretic approach to constraint LTL
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...
Stéphane Demri, Deepak D'Souza
PR
2006
65views more  PR 2006»
13 years 8 months ago
Why direct LDA is not equivalent to LDA
In this paper, we present counterarguments against the direct LDA algorithm (D-LDA), which was previously claimed to be equivalent to Linear Discriminant Analysis (LDA). We show f...
Hui Gao, James W. Davis
IMAMCI
2007
70views more  IMAMCI 2007»
13 years 8 months ago
On the geometry of stability regions of Smith predictors subject to delay uncertainty
In this paper, we present a geometric method for describing the effects of the delay induced uncertainty on the stability of a standard Smith Predictor control scheme. The method...
Constantin-Irinel Morarescu, Silviu-Iulian Nicules...
CAD
2005
Springer
13 years 8 months ago
Euclidean Voronoi diagram of 3D balls and its computation via tracing edges
Despite its important applications in various disciplines in science and engineering, the Euclidean Voronoi diagram for spheres, also known as an additively weighted Voronoi diagr...
Deok-Soo Kim, Youngsong Cho, Donguk Kim