Sciweavers

1969 search results - page 151 / 394
» Financial Theory 1
Sort
View
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 6 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
GECCO
2004
Springer
175views Optimization» more  GECCO 2004»
15 years 12 months ago
Enhanced Innovation: A Fusion of Chance Discovery and Evolutionary Computation to Foster Creative Processes and Decision Making
Abstract. Human-based genetic algorithms are powerful tools for organizational modeling. If we enhance them using chance discovery techniques, we obtain an innovative approach for ...
Xavier Llorà, Kei Ohnishi, Ying-Ping Chen, ...
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 11 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
SCALESPACE
2001
Springer
15 years 11 months ago
Scale-Time Kernels and Models
Receptive field sensitivity profiles of visual front-end cells in the LGN and V1 area in intact animals can be measured with increasing accuracy, both in the spatial and temporal...
Bart M. ter Haar Romeny, Luc Florack, Mads Nielsen
STACS
1998
Springer
15 years 10 months ago
Random Sparse Bit Strings at the Threshold of Adjacency
d Abstract appeared in STACS `98) Joel H. Spencer1 and Katherine St. John2 1 Courant Institute, New York University, New York, NY 10012 2 Department of Mathematics, Santa Clara Uni...
Joel Spencer, Katherine St. John