1071 search results - page 29 / 215 » Using Cell-DEVS for Modeling Complex Cell Spaces |
127
click to vote
JAT
2010
14 years 10 months ago
2010
We describe the theoretical solution of an approximation problem that uses a finite weighted sum of complex exponential functions. The problem arises in an optimization model for t...
126
click to vote
VISUALIZATION
1999
IEEE
15 years 7 months ago
1999
IEEE
We present a technique for optimizing the rendering of highdepth complexity scenes. Prioritized-Layered Projection (PLP) does this by rendering an estimation of the visible set fo...
153
click to vote
IWCIA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
141
click to vote
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
140
click to vote
TNN
2011
14 years 10 months ago
2011
—Reservoir computing (RC) refers to a new class of state-space models with a fixed state transition structure (the “reservoir”) and an adaptable readout form the state space...