Sciweavers

1258 search results - page 244 / 252
» Architecture-driven Problem Decomposition
Sort
View
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 11 days ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
14 years 9 days ago
Evolving the placement and density of neurons in the hyperneat substrate
The Hypercube-based NeuroEvolution of Augmenting Topologies (HyperNEAT) approach demonstrated that the pattern of weights across the connectivity of an artificial neural network ...
Sebastian Risi, Joel Lehman, Kenneth O. Stanley
DIS
2001
Springer
14 years 4 hour ago
Functional Trees
In the context of classification problems, algorithms that generate multivariate trees are able to explore multiple representation languages by using decision tests based on a com...
Joao Gama
ECCV
2000
Springer
13 years 12 months ago
Factorization with Uncertainty
Factorization using Singular Value Decomposition (SVD) is often used for recovering 3D shape and motion from feature correspondences across multiple views. SVD is powerful at find...
Michal Irani, P. Anandan
SIGGRAPH
1998
ACM
13 years 11 months ago
Recovering Photometric Properties of Architectural Scenes from Photographs
In this paper, we present a new approach to producing photorealistic computer renderings of real architectural scenes under novel lighting conditions, such as at different times o...
Yizhou Yu, Jitendra Malik