656 search results - page 48 / 132 » Graph Theoretical Characterization and Computation of Answer... |
COMBINATORICA
2008
14 years 8 months ago
2008
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
LSSC
2007
Springer
15 years 3 months ago
2007
Springer
We present a general framework for analysis and design of optimization based numerical feedback stabilization schemes utilizing ideas from relaxed dynamic programming. The applicat...
CCCG
2009
14 years 10 months ago
2009
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
ACSC
2002
IEEE
15 years 2 months ago
2002
IEEE
We propose a flow-sensitive alias analysis algorithm that computes safe and efficient alias sets in Java. For that, we propose a references-set representation of aliased elements,...
115
click to vote
COLT
2000
Springer
15 years 1 months ago
2000
Springer
In the present paper, we present the theoretical basis, as well as an empirical validation, of a protocol designed to obtain effective VC dimension estimations in the case of a si...