Sciweavers

7006 search results - page 532 / 1402
» Approximation Algorithms
Sort
View
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
15 years 8 months ago
An efficient algorithm for a class of fused lasso problems
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...
Jun Liu, Lei Yuan, Jieping Ye
MASCOTS
2001
15 years 8 months ago
Large-Scale Simulation of Replica Placement Algorithms for a Serverless Distributed File System
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...
John R. Douceur, Roger Wattenhofer
IJCAI
2003
15 years 8 months ago
Algorithms for Identifying Rigid Subsystems in Geometric Constraint Systems
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...
Christophe Jermann, Bertrand Neveu, Gilles Trombet...
DC
2010
15 years 6 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
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...
Seth Pettie
CDC
2010
IEEE
141views Control Systems» more  CDC 2010»
15 years 1 months ago
Hybrid moment computation algorithm for biochemical reaction networks
Moment computation is essential to the analysis of stochastic kinetic models of biochemical reaction networks. It is often the case that the moment evolution, usually the first and...
Yun-Bo Zhao, Jongrae Kim, João Pedro Hespan...