394 search results - page 55 / 79 » Computing Minimal Polynomials of Matrices |
97
Voted
INFOCOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically fail to detect attacks and also gener...
92
Voted
ECCC
2006
15 years 14 days ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
95
Voted
DAC
2004
ACM
16 years 1 months ago
2004
ACM
For multi-gigahertz synchronous designs in nanometer technologies, multiple clock cycles are needed to cross the global interconnects, thus making it necessary to have pipelined g...
103
click to vote
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V, E1) and G2 = (V, E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \ E1 such ...
102
click to vote
ESA
2000
Springer
15 years 4 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...