CPM
2010
Springer
12 years 11 months ago
2010
Springer
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We prove that for any real-valued matrix X ∈ Rm×n , and positive integers r k, there is a subset of r columns of X such that projecting X onto their span gives a r+1 r−k+1 -a...
AUTOMATICA
2005
13 years 4 months ago
2005
: Given a continuous-time controller and a Lyapunov function that shows global asymptotic stability for the closed loop system, we provide several results for modification of the c...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...