4047 search results - page 319 / 810 » The Discrete Basis Problem |
169
click to vote
COMPGEOM
2006
ACM
15 years 8 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...
138
click to vote
ECCV
1998
Springer
16 years 6 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
134
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
155
Voted
PPOPP
2005
ACM
15 years 10 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
155
click to vote
TIME
2002
IEEE
15 years 9 months ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...