683 search results - page 41 / 137 » A Fine-grained Analysis of a Simple Independent Set Algorith... |
145
Voted
STOC
2001
ACM
16 years 3 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
151
click to vote
COMPGEOM
2006
ACM
15 years 7 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
103
Voted
JAR
1998
15 years 3 months ago
1998
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
154
Voted
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
The ability to predict the quality of a software object can be viewed as a classification problem, where software metrics are the features and expert quality rankings the class lab...
149
Voted
GEOS
2007
Springer
15 years 9 months ago
2007
Springer
Spatio-temporal network is defined by a set of nodes, and a set of edges, where the properties of nodes and edges may vary over time. Such networks are encountered in a variety of...