5055 search results - page 348 / 1011 » Relative Timing |
181
click to vote
STACS
2004
Springer
16 years 23 days 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 ...
176
click to vote
ICLP
2003
Springer
16 years 19 days ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
252
click to vote
ICVS
2003
Springer
16 years 19 days ago
2003
Springer
The paper considers detecting and tracking multiple moving objects in real time by a multiagent active vision system. The main objective of the envisioned system is to maintain an ...
231
click to vote
FOCS
2002
IEEE
16 years 11 days 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...
221
click to vote
JAVA
2001
Springer
15 years 12 months ago
2001
Springer
Many concurrent garbage collection (GC) algorithms have been devised, but few have been implemented and evaluated, particularly for the Java programming language. Sapphire is an a...