7129 search results - page 538 / 1426 » Approximation Algorithms for Treewidth |
220
click to vote
COMPGEOM
2005
ACM
15 years 9 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
140
click to vote
KDD
2010
ACM
15 years 9 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
214
click to vote
MASCOTS
2001
15 years 8 months ago
2001
Farsite is a scalable, distributed file system that logically functions as a centralized file server but that is physically implemented on a set of client desktop computers. Farsi...
154
click to vote
IJCAI
2003
15 years 8 months ago
2003
The structural rigidity property, a generalization of Laman’s theorem which characterizes rigid bar frameworks in 2D, is generally considered a good approximation of rigidity in...
179
click to vote
DC
2010
15 years 7 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...