Sciweavers

6142 search results - page 512 / 1229
» The Complexity of Partition Functions
Sort
View
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
16 years 1 months ago
Expensive optimization, uncertain environment: an EA-based solution
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
Maumita Bhattacharya
RT
1998
Springer
15 years 11 months ago
Automatic Calculation of Soft Shadow Textures for Fast, High-Quality Radiosity
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a "standard" hierarchi...
Cyril Soler, François X. Sillion
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
15 years 9 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
JMM2
2007
96views more  JMM2 2007»
15 years 6 months ago
A Framework for Linear Transform Approximation Using Orthogonal Basis Projection
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
Yinpeng Chen, Hari Sundaram
TWC
2008
146views more  TWC 2008»
15 years 6 months ago
Synchronization, Channel Estimation, and Equalization in MB-OFDM Systems
Abstract-- This paper addresses preamble-based low complexity synchronization, channel estimation and equalization for Zero-padded (ZP) MB-OFDM based UWB systems. The proposed sync...
Yinghui Li, Hlaing Minn, R. M. A. Rajatheva