730 search results - page 86 / 146 » Combinatorics of Monotone Computations |
125
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We propose a novel method for the classification of EEG signals during motor-imagery. For motor-imagery based brain computer interface (MI-BCI), a method called common spatial pa...
128
click to vote
MP
2011
14 years 7 months ago
2011
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
160
click to vote
ICDT
2012
ACM
13 years 6 months ago
2012
ACM
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
189
click to vote
CPM
1998
Springer
15 years 8 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
139
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...