Sciweavers

2652 search results - page 145 / 531
» Privacy-preserving linear programming
Sort
View
AUTOMATICA
2006
91views more  AUTOMATICA 2006»
15 years 3 months ago
Necessary and sufficient conditions for reachability on a simplex
In this paper we solve the general problem of designing a feedback controller to reach a set of facets of an n-dimensional simplex in finite time, for a system evolving with linea...
Bartek Roszak, Mireille E. Broucke
SIAMCOMP
2008
95views more  SIAMCOMP 2008»
15 years 3 months ago
On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
Nir Halman
TNN
2008
81views more  TNN 2008»
15 years 3 months ago
Nonlinear Knowledge-Based Classification
Prior knowledge over general nonlinear sets is incorporated into nonlinear kernel classification problems as linear constraints in a linear program. The key tool in this incorpora...
Olvi L. Mangasarian, Edward W. Wild
ESOP
2010
Springer
16 years 20 days ago
Amortized Resource Analysis with Polynomial Potential - A Static Inference of Polynomial Bounds for Functional Programs
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. ...
Jan Hoffmann and Martin Hofmann
CORR
2008
Springer
71views Education» more  CORR 2008»
15 years 3 months ago
A Survey of Quantum Programming Languages: History, Methods, and Tools
Quantum computer programming is emerging as a new subject domain from multidisciplinary research in quantum computing, computer science, mathematics (especially quantum logic, lamb...
Donald A. Sofge