Sciweavers

3049 search results - page 242 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
15 years 11 months ago
On optimal anonymization for l+-diversity
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
Junqiang Liu, Ke Wang
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
15 years 8 months ago
Optimal Random Matchings on Trees and Applications
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
Jeff Abrahamson, Béla Csaba, Ali Shokoufand...
ICML
2005
IEEE
16 years 7 months ago
Learning predictive representations from a history
Predictive State Representations (PSRs) have shown a great deal of promise as an alternative to Markov models. However, learning a PSR from a single stream of data generated from ...
Eric Wiewiora
COR
2004
291views more  COR 2004»
15 years 6 months ago
Cycling in linear programming problems
We collected and analyzed a number of linear programming problems that have been shown to cycle (not converge) when solved by Dantzig's original simplex algorithm. For these ...
Saul I. Gass, Sasirekha Vinjamuri
SIAMJO
2010
92views more  SIAMJO 2010»
15 years 1 months ago
Inexact Proximal Point Methods for Variational Inequality Problems
We present a new family of proximal point methods for solving monotone variational inequalities. Our algorithm has a relative error tolerance criterion in solving the proximal subp...
Regina Sandra Burachik, Joydeep Dutta