3068 search results - page 178 / 614 » Clustering with Multiple Graphs |
137
click to vote
ACSAC
2003
IEEE
15 years 7 months ago
2003
IEEE
When a receiver of a ciphertext message can not decrypt the message due to the fact that he has lost his private-key, the private-key of the receiver and session-key of the messag...
142
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
165
click to vote
VMV
2008
15 years 5 months ago
2008
This work presents a real-time, data-parallel approach for global label assignment on regular grids. The labels are selected according to a Markov random field energy with a Potts...
136
click to vote
ISSAC
2009
Springer
15 years 10 months ago
2009
Springer
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
142
click to vote
IV
2008
IEEE
15 years 10 months ago
2008
IEEE
There is a large number of interactive visualization tools, however no universal tool exists that covers all relevant aspects for all possible application domains. We have develop...