2069 search results - page 76 / 414 » Linear time algorithms for Clobber |
125
click to vote
ISSAC
2005
Springer
15 years 9 months ago
2005
Springer
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈ [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
139
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
137
click to vote
TSP
2008
15 years 3 months ago
2008
We consider sequential regression of individual sequences under the square error loss. Using a competitive algorithm framework, we construct a sequential algorithm that can achieve...
127
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
121
click to vote
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
A major limitation of Brain-Computer Interfaces (BCI) is their long calibration time, as much data from the user must be collected in order to tune the BCI for this target user. I...