Sciweavers

2938 search results - page 42 / 588
» On obfuscating point functions
Sort
View
140
Voted
EOR
2008
103views more  EOR 2008»
15 years 5 months ago
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
Maziar Salahi, M. Reza Peyghami, Tamás Terl...
CAISE
2008
Springer
15 years 7 months ago
Measuring the Functional Size of Conceptual Models in an MDA Environment
The measurement of the functional size of applications generated in MDA environments is a challenge for the software development industry. This paper presents the OO-Method COSMIC ...
Beatriz Marín, Nelly Condori-Fernánd...
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 3 months ago
Learning Functions of Few Arbitrary Linear Parameters in High Dimensions
Let us assume that f is a continuous function defined on the unit ball of Rd , of the form f(x) = g(Ax), where A is a k×d matrix and g is a function of k variables for k ≪ d. ...
Massimo Fornasier, Karin Schnass, Jan Vybír...
VIS
2007
IEEE
120views Visualization» more  VIS 2007»
16 years 6 months ago
Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions
The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and th...
Attila Gyulassy, Vijay Natarajan, Valerio Pascuc...
STOC
2012
ACM
236views Algorithms» more  STOC 2012»
13 years 7 months ago
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
We propose a new notion of secure multiparty computation aided by a computationally-powerful but untrusted “cloud” server. In this notion that we call on-the-fly multiparty c...
Adriana López-Alt, Eran Tromer, Vinod Vaiku...