Sciweavers

261 search results - page 13 / 53
» A randomized polynomial-time simplex algorithm for linear pr...
Sort
View
POPL
2000
ACM
15 years 5 months ago
Verifying Secrets and Relative Secrecy
Systems that authenticate a user based on a shared secret (such as a password or PIN) normally allow anyone to query whether the secret is a given value. For example, an ATM machi...
Dennis M. Volpano, Geoffrey Smith
ML
2002
ACM
167views Machine Learning» more  ML 2002»
15 years 1 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
AUTOMATICA
2007
103views more  AUTOMATICA 2007»
15 years 1 months ago
Lexicographic perturbation for multiparametric linear programming with applications to control
Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs with a parameter in the cost, or equivalently the right-...
Colin Neil Jones, Eric C. Kerrigan, Jan M. Maciejo...
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
16 years 3 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...
SODA
2004
ACM
161views Algorithms» more  SODA 2004»
15 years 3 months ago
Approximation schemes for Metric Bisection and partitioning
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...