394 search results - page 63 / 79 » Computing Minimal Polynomials of Matrices |
116
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
102
click to vote
GD
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
114
Voted
GD
2009
Springer
15 years 26 days ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
125
click to vote
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
119
click to vote
FUIN
2008
15 years 3 months ago
2008
We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in t...