Sciweavers

15375 search results - page 3014 / 3075
» cans 2008
Sort
View
ANTSW
2008
Springer
13 years 11 months ago
Adaptive Particle Swarm Optimization
An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perfor...
Zhi-hui Zhan, Jun Zhang
APGV
2008
ACM
141views Visualization» more  APGV 2008»
13 years 11 months ago
The assumed light direction for perceiving shape from shading
Recovering 3D shape from shading is an ill-posed problem that the visual system can solve only by making use of additional information such as the position of the light source. Pr...
James P. O'Shea, Martin S. Banks, Maneesh Agrawala
APLAS
2008
ACM
13 years 11 months ago
Exception Handlers as Extensible Cases
Abstract. Exceptions are an indispensable part of modern programming languages. They are, however, handled poorly, especially by higherorder languages such as Standard ML and Haske...
Matthias Blume, Umut A. Acar, Wonseok Chae
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 11 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
13 years 11 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
« Prev « First page 3014 / 3075 Last » Next »