5606 search results - page 539 / 1122 » Randomization Techniques for Graphs. |
184
click to vote
PCI
2005
Springer
16 years 21 days ago
2005
Springer
In this paper, we present the rationale and the baseline of a notation which can be used on its own or as an extension to standard UML to facilitate specification of an interactive...
173
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper presents our work on the static task scheduling model using the mean-field annealing (MFA) technique. Mean-field annealing is a technique of thermostatic annealing that...
187
click to vote
GD
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. Techniques for drawing graphs based on force-directed placement and virtual physical models have proven surprisingly successful in producing good layouts of undirected gr...
167
click to vote
DAC
1993
ACM
15 years 11 months ago
1993
ACM
— We consider the resource-constrained scheduling of loops with interiteration dependencies. A loop is modeled as a data flow graph (DFG), where edges are labeled with the numbe...
239
click to vote
ICB
2007
Springer
15 years 11 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 ...