15073 search results - page 374 / 3015 » Probabilistic algorithms for computing resultants |
172
click to vote
COCOON
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
149
click to vote
CCCG
2009
15 years 6 months ago
2009
In structural molecular biology software, the accessibility of an atom in a molecule to a ball representing solvent is either computed slowly by building a solventaccessible surfa...
156
click to vote
COMGEO
2000
ACM
15 years 5 months ago
2000
ACM
Given a set X of points in the plane, two distinguished points s,t X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t...
137
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...
159
click to vote
PDP
2007
IEEE
15 years 11 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...