1550 search results - page 119 / 310 » Benchmarking for Graph Transformation |
94
Voted
DAC
2009
ACM
16 years 4 months ago
2009
ACM
Current compilers lack precise timing models guiding their built-in optimizations. Hence, compilers apply ad-hoc heuristics during optimization to improve code quality. One of the...
131
Voted
LION
2009
Springer
15 years 10 months ago
2009
Springer
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
121
Voted
PKDD
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This article presents a method for training Dynamic Factor Graphs (DFG) with continuous latent state variables. A DFG includes factors modeling joint probabilities betwee...
134
Voted
TAICPART
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract. Writing multithreaded software for multicore computers confronts many developers with the difficulty of finding parallel programming errors. In the past, most parallel d...
145
Voted
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....