5606 search results - page 445 / 1122 » Randomization Techniques for Graphs. |
165
click to vote
ACSAC
2005
IEEE
16 years 12 days ago
2005
IEEE
In this paper, we present techniques for a network forensics analysis mechanism that includes effective evidence presentation, manipulation and automated reasoning. We propose the...
160
click to vote
ECCV
2010
Springer
16 years 3 days ago
2010
Springer
A technique for calibrating a network of perspective cameras based on their graph of trifocal tensors is presented. After estimating a set of reliable epipolar geometries, a parame...
217
click to vote
IPCO
2008
15 years 8 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
182
click to vote
AAAI
2006
15 years 8 months ago
2006
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...
158
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...