Sciweavers

3946 search results - page 331 / 790
» The computational complexity of choice sets
Sort
View
EVOW
2008
Springer
15 years 8 months ago
A Study of Some Implications of the No Free Lunch Theorem
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
Andrea Valsecchi, Leonardo Vanneschi
227
Voted
COMPGEOM
2011
ACM
14 years 10 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
VIS
2004
IEEE
116views Visualization» more  VIS 2004»
16 years 8 months ago
Interactive Design of Multi-Perspective Images for Visualizing Urban Landscapes
Multi-perspective images are a useful way to visualize extended, roughly planar scenes such as landscapes or city blocks. However, constructing effective multi-perspective images ...
Augusto Román, Gaurav Garg, Marc Levoy
221
Voted
ICS
2004
Tsinghua U.
16 years 6 days ago
EXPERT: expedited simulation exploiting program behavior repetition
Studying program behavior is a central component in architectural designs. In this paper, we study and exploit one aspect of program behavior, the behavior repetition, to expedite...
Wei Liu, Michael C. Huang
TSP
2008
94views more  TSP 2008»
15 years 6 months ago
Cross-Entropy-Based Sign-Selection Algorithms for Peak-to-Average Power Ratio Reduction of OFDM Systems
Sign-selection uses a set of subcarrier signs to reduce the peak-to-average power ratio (PAR) of orthogonal-frequency-division multiplexing (OFDM). However, the computational compl...
Luqing Wang, Chintha Tellambura