874 search results - page 53 / 175 » Faster Algorithms for Semi-Matching Problems |
UAI
2003
13 years 9 months ago
2003
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
AI
2006
Springer
13 years 7 months ago
2006
Springer
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
ESA
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
ISSAC
2005
Springer
14 years 1 months ago
2005
Springer
Let A and B be two polynomials in [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...