5606 search results - page 640 / 1122 » Randomization Techniques for Graphs. |
250
click to vote
TKDE
2011
15 years 1 months ago
2011
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
277
click to vote
RTA
2011
Springer
14 years 9 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
244
click to vote
ICCV
2011
IEEE
14 years 7 months ago
2011
IEEE
This paper addresses the challenge of recognizing behavior of groups of individuals in unconstraint surveillance environments. As opposed to approaches that rely on agglomerative ...
240
click to vote
SOQUA
2007
15 years 8 months ago
2007
When choosing a testing technique, practitioners want to know which one will detect the faults that matter most to them in the programs that they plan to test. Do empirical evalua...
221
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
We present a new approach for the discriminative training
of continuous-valued Markov Random Field (MRF)
model parameters. In our approach we train the MRF
model by optimizing t...