2432 search results - page 157 / 487 » Degrees and choice numbers |
157
click to vote
SAMOS
2004
Springer
15 years 11 months ago
2004
Springer
— Architectural resources and program recurrences are the main limitations to the amount of Instruction-Level Parallelism (ILP) exploitable from loops, the most time-consuming pa...
155
click to vote
STACS
2004
Springer
15 years 11 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
170
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
We present an approach that extends the BentleyOttmann sweep-line algorithm [3] to the exact computation of the topology of arrangements induced by non-singular algebraic curves o...
194
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
165
click to vote
EWHCI
1993
15 years 10 months ago
1993
One of the new design goals in Human Computer Interaction is to extend the sensory-motor capabilities of computer systems to better match the natural communication means of human b...