Sciweavers

530 search results - page 105 / 106
» Dirichlet Process Mixtures of Generalized Linear Models
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
13 years 10 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
NIPS
2007
13 years 7 months ago
Receptive Fields without Spike-Triggering
Stimulus selectivity of sensory neurons is often characterized by estimating their receptive field properties such as orientation selectivity. Receptive fields are usually deriv...
Jakob Macke, Guenther Zeck, Matthias Bethge
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 5 months ago
Evolution with Drifting Targets
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...
Varun Kanade, Leslie G. Valiant, Jennifer Wortman ...
LCTRTS
2009
Springer
14 years 17 days ago
Synergistic execution of stream programs on multicores with accelerators
The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multicore architectures. The StreamIt graphs describe task, da...
Abhishek Udupa, R. Govindarajan, Matthew J. Thazhu...
SIAMIS
2010
156views more  SIAMIS 2010»
13 years 16 days ago
Learning the Morphological Diversity
This article proposes a new method for image separation into a linear combination of morphological components. Sparsity in fixed dictionaries is used to extract the cartoon and osc...
Gabriel Peyré, Jalal Fadili, Jean-Luc Starc...