Sciweavers

99 search results - page 15 / 20
» An Analysis of the Convergence of Graph Laplacians
Sort
View
AAAI
2007
13 years 9 months ago
Compact Spectral Bases for Value Function Approximation Using Kronecker Factorization
A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-val...
Jeffrey Johns, Sridhar Mahadevan, Chang Wang
FOCS
1992
IEEE
13 years 11 months ago
Quadratic Dynamical Systems (Preliminary Version)
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...
Yuri Rabinovich, Alistair Sinclair, Avi Wigderson
ICFP
2003
ACM
14 years 7 months ago
Iterative-free program analysis
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 7 months ago
On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
Iryna Andriyanova, Jean-Pierre Tillich
ATAL
2008
Springer
13 years 9 months ago
Sensing-based shape formation on modular multi-robot systems: a theoretical study
This paper presents a theoretical study of decentralized control for sensing-based shape formation on modular multirobot systems, where the desired shape is specified in terms of ...
Chih-Han Yu, Radhika Nagpal