Sciweavers

1538 search results - page 247 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
CC
2004
Springer
15 years 6 months ago
Using Multiple Memory Access Instructions for Reducing Code Size
An important issue in embedded systems design is the size of programs. As computing devices decrease in size, yet with more and more functions, better code size optimizations are i...
Neil Johnson, Alan Mycroft
CGO
2004
IEEE
15 years 5 months ago
Optimizing Translation Out of SSA Using Renaming Constraints
Static Single Assignment form is an intermediate representation that uses instructions to merge values at each confluent point of the control flow graph. instructions are not ma...
Fabrice Rastello, François de Ferriè...
CVPR
2003
IEEE
16 years 3 months ago
Nonparametric Belief Propagation
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
Erik B. Sudderth, Alexander T. Ihler, William T. F...
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
15 years 2 months ago
Enhanced generalized ant programming (EGAP)
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
Amirali Salehi-Abari, Tony White
CVPR
2003
IEEE
16 years 3 months ago
Stereo Matching with Reflections and Translucency
In this paper, we address the stereo matching problem in the presence of reflections and translucency, where image formation can be modeled as the additive superposition of layers...
Yanghai Tsin, Sing Bing Kang, Richard Szeliski