1383 search results - page 50 / 277 » On the Complexity of the Interlace Polynomial |
155
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—Modern Personal Digital Assistant (PDA) architectures often utilize a wholesale data transfer protocol known as “slow sync” for synchronizing PDAs with Personal Computers (P...
174
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
125
click to vote
DATE
2008
IEEE
16 years 18 days ago
2008
IEEE
This paper presents two fully polynomial-time sufficient feasibility tests for EDF when considering periodic tasks with arbitrary deadlines and preemptive scheduling on uniproces...
161
click to vote
EJC
2008
15 years 6 months ago
2008
1 Rational functions and minimal factorizations of permutations Let f : C C be a rational function of degree n in one complex variable. A critical point of f is a point z C such...
212
click to vote
SIAMCOMP
2010
15 years 27 days ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...