5100 search results - page 299 / 1020 » The Linear Complexity of a Graph |
140
click to vote
DEDS
2010
15 years 4 months ago
2010
In discrete event systems, a given task can start executing when all the required input data are available. The required input data for a given task may change along the evolution...
137
click to vote
IM
2008
15 years 4 months ago
2008
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
175
click to vote
CORR
2012
Springer
14 years 8 days ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
144
Voted
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
The problem we study is; Given N views and a subset of the ??? ??? interview fundamental matrices, which of the other fundamental matrices can we compute using only the precompute...
145
click to vote
ISCAS
1994
IEEE
15 years 8 months ago
1994
IEEE
This paper addresses the problem of minimizing the clock period of a circuit by optimizingthe clock skews. We incorporate uncertainty factors and present a formulation that ensure...