Sciweavers

16626 search results - page 3313 / 3326
» Computing is a natural science
Sort
View
JCNS
2010
119views more  JCNS 2010»
14 years 12 months ago
Disentanglement of local field potential sources by independent component analysis
The spontaneous activity of working neurons yields synaptic currents that mix up in the volume conductor. This activity is picked up by intracerebral recording electrodes as local ...
Valeri A. Makarov, Ioulia Makarova, Oscar Herreras
KDD
2010
ACM
304views Data Mining» more  KDD 2010»
14 years 11 months ago
Automatic malware categorization using cluster ensemble
Malware categorization is an important problem in malware analysis and has attracted a lot of attention of computer security researchers and anti-malware industry recently. Todayâ...
Yanfang Ye, Tao Li, Yong Chen, Qingshan Jiang
LATIN
2010
Springer
14 years 11 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant†if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen
MST
2010
101views more  MST 2010»
14 years 11 months ago
Non-Uniform Reductions
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
Harry Buhrman, Benjamin J. Hescott, Steven Homer, ...
SAGT
2010
Springer
164views Game Theory» more  SAGT 2010»
14 years 11 months ago
On Nash-Equilibria of Approximation-Stable Games
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
Pranjal Awasthi, Maria-Florina Balcan, Avrim Blum,...
« Prev « First page 3313 / 3326 Last » Next »