5606 search results - page 555 / 1122 » Randomization Techniques for Graphs. |
192
click to vote
CC
2006
Springer
15 years 11 months ago
2006
Springer
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
183
click to vote
DIALM
2005
ACM
15 years 9 months ago
2005
ACM
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
182
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
Abstract. In the context of an approach for reengineering legacy software systems at the architectural level, we present in this paper a reverse engineering methodology that uses a...
169
click to vote
EUSFLAT
2003
15 years 8 months ago
2003
Functional laws may be known only at a finite number of points, and then the function can be completed by interpolation techniques obeying some smoothness conditions. We rather pr...
203
click to vote
UAI
2004
15 years 8 months ago
2004
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...