1722 search results - page 136 / 345 » On the sample mean of graphs |
173
click to vote
PDP
2003
IEEE
15 years 11 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
155
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
We show that no Markovian Coupling argument can prove rapid mixing of the Jerrum-Sinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect match...
203
click to vote
ICB
2007
Springer
15 years 10 months ago
2007
Springer
We present a feature-based 3D face recognition algorithm and propose a keypoint identification technique which is repeatable and identifies keypoints where shape variation is high ...
154
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
- We introduce a transformation, named rephasing, that manipulates the timing parameters in control-dataflow graphs. Traditionally high-level synthesis systems for DSP have either ...
201
click to vote
JMLR
2006
15 years 6 months ago
2006
We describe anytime search procedures that (1) find disjoint subsets of recorded variables for which the members of each subset are d-separated by a single common unrecorded cause...