Sciweavers

6129 search results - page 843 / 1226
» A parallel LLL algorithm
Sort
View
175
Voted
SODA
1990
ACM
114views Algorithms» more  SODA 1990»
15 years 8 months ago
Finding Steiner Forests in Planar Graphs
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki
265
Voted
GECCO
2008
Springer
363views Optimization» more  GECCO 2008»
15 years 7 months ago
Towards high speed multiobjective evolutionary optimizers
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder
CGF
2010
189views more  CGF 2010»
15 years 6 months ago
Real-time Depth of Field Rendering via Dynamic Light Field Generation and Filtering
We present a new algorithm for efficient rendering of high-quality depth-of-field (DoF) effects. We start with a single rasterized view (reference view) of the scene, and sample t...
Xuan Yu, Rui Wang, Jingyi Yu
GIS
2006
ACM
15 years 6 months ago
Dynamic simplification and visualization of large maps
In this paper, we present an algorithm that performs simplification of large geographical maps through a novel use of graphics hardware. Given a map as a collection of non-interse...
Nabil H. Mustafa, Shankar Krishnan, Gokul Varadhan...
NECO
2008
129views more  NECO 2008»
15 years 6 months ago
Sparse Coding via Thresholding and Local Competition in Neural Circuits
While evidence indicates that neural systems may be employing sparse approximations to represent sensed stimuli, the mechanisms underlying this ability are not understood. We desc...
Christopher J. Rozell, Don H. Johnson, Richard G. ...