Sciweavers

9949 search results - page 33 / 1990
» On the Network Complexity of Selection
Sort
View
TSP
2010
13 years 3 months ago
Low complexity equalization for doubly selective channels modeled by a basis expansion
We propose a novel equalization method for doubly selective wireless channels, whose taps are represented by an arbitrary Basis Expansion Model (BEM). We view such a channel in the...
Tomasz Hrycak, Saptarshi Das, Gerald Matz, Hans G....
EMNLP
2008
13 years 10 months ago
Selecting Sentences for Answering Complex Questions
Complex questions that require inferencing and synthesizing information from multiple documents can be seen as a kind of topicoriented, informative multi-document summarization. I...
Yllias Chali, Shafiq R. Joty
SMA
2005
ACM
167views Solid Modeling» more  SMA 2005»
14 years 2 months ago
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
Peter Hachenberger, Lutz Kettner
CEC
2005
IEEE
14 years 2 months ago
On the complexity of overcoming gaps with isotropic mutations and elitist selection
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
Jens Jägersküpper