2446 search results - page 109 / 490 » Choiceless Polynomial Time |
112
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
85
Voted
WEBDB
2005
Springer
15 years 6 months ago
2005
Springer
Nonrecursive XQuery is known to be hard for nondeterministic exponential time. Thus it is commonly believed that any algorithm for evaluating XQuery has to require exponential amo...
83
Voted
VLSID
1999
IEEE
15 years 5 months ago
1999
IEEE
Accurate output response computation of RC interconnects under various input excitations is a key issue in deep submicron delay analysis.In this paper,we present an exact analysis...
138
click to vote
AAIM
2007
Springer
15 years 7 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
103
click to vote
COMPGEOM
2004
ACM
15 years 6 months ago
2004
ACM
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a “repulsive” energy function. This algor...