251 search results - page 39 / 51 » Constructive Linear Time Algorithms for Branchwidth |
86
Voted
SIGGRAPH
1993
ACM
15 years 3 months ago
1993
ACM
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
STOC
2003
ACM
15 years 12 months ago
2003
ACM
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
145
click to vote
ICPP
1995
IEEE
15 years 3 months ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...