Sciweavers

1161 search results - page 56 / 233
» Kinetic Dependence Graphs
Sort
View
DAM
1999
90views more  DAM 1999»
15 years 4 months ago
Note on a Helicopter Search Problem on Graphs
We consider a search game on a graph in which one cop in a helicopter flying from vertex to vertex tries to catch the invisible robber. The existence of the winning program for th...
Fedor V. Fomin
113
Voted
ICIP
2010
IEEE
15 years 2 months ago
Local two-channel critically sampled filter-banks on graphs
In this paper, we propose two-channel filter-bank designs for signals defined on arbitrary graphs. These filter-banks are local, invertible and critically sampled. Depending on th...
Sunil K. Narang, Antonio Ortega
CORR
2010
Springer
175views Education» more  CORR 2010»
15 years 5 months ago
On affine rigidity
We study the properties of affine rigidity of a (hyper)graph and prove a variety of fundamental results. First, we show that affine rigidity is a generic property (i.e., only depen...
Steven J. Gortler, Craig Gotsman, Ligang Liu, Dyla...
149
Voted
DAM
2008
72views more  DAM 2008»
15 years 5 months ago
Minimization of circuit registers: Retiming revisited
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...
Bruno Gaujal, Jean Mairesse
IPL
2000
105views more  IPL 2000»
15 years 4 months ago
Coverings that preserve sense of direction
Sense of direction is a property of labelled networks (i.e., arc-coloured graphs) that allows one to assign coherently local identifiers to other processors on the basis of the ro...
Paolo Boldi, Sebastiano Vigna