1604 search results - page 100 / 321 » Approximation algorithms for developable surfaces |
CIKM
2003
Springer
15 years 6 months ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
143
Voted
CGVR
2010
14 years 11 months ago
2010
We demonstrate a generic method for visualization of high-resolution unorganized and noisy 3D data points with a surface of significantly lower resolution. To this effect, we feed...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
123
click to vote
RCIS
2010
14 years 12 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
133
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...