Sciweavers

82 search results - page 3 / 17
» Lower Bounds for the Smoothed Number of Pareto optimal Solut...
Sort
View
ISSS
2000
IEEE
127views Hardware» more  ISSS 2000»
13 years 10 months ago
Lower Bound Estimation for Low Power High-Level Synthesis
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
Lars Kruse, Eike Schmidt, Gerd Jochens, Ansgar Sta...
CVPR
2000
IEEE
14 years 7 months ago
On the Number of Samples Needed in Light Field Rendering with Constant-Depth Assumption
While several image-based rendering techniques have been proposed to successfully render scenes/objects from a large collection (e.g., thousands) of images without explicitly reco...
Zhouchen Lin, Heung-Yeung Shum
BMCBI
2007
153views more  BMCBI 2007»
13 years 5 months ago
Lower bounds on multiple sequence alignment using exact 3-way alignment
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
Charles J. Colbourn, Sudhir Kumar
EMO
2005
Springer
194views Optimization» more  EMO 2005»
13 years 11 months ago
An EMO Algorithm Using the Hypervolume Measure as Selection Criterion
Abstract. The hypervolume measure is one of the most frequently applied measures for comparing the results of evolutionary multiobjective optimization algorithms (EMOA). The idea t...
Michael Emmerich, Nicola Beume, Boris Naujoks
JC
2007
109views more  JC 2007»
13 years 5 months ago
Cubature formulas for function spaces with moderate smoothness
We construct simple algorithms for high-dimensional numerical integration of function classes with moderate smoothness. These classes consist of square-integrable functions over t...
Michael Gnewuch, René Lindloh, Reinhold Sch...