Sciweavers

4114 search results - page 166 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
CCE
2004
15 years 6 months ago
Continuous reformulations of discrete-continuous optimization problems
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer n...
Oliver Stein, Jan Oldenburg, Wolfgang Marquardt
CRYPTO
2008
Springer
134views Cryptology» more  CRYPTO 2008»
15 years 8 months ago
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
Chris Peikert, Vinod Vaikuntanathan
ICAC
2005
IEEE
15 years 12 months ago
Quickly Finding Known Software Problems via Automated Symptom Matching
We present an architecture for and prototype of a system for quickly detecting software problem recurrences. Re-discovery of the same problem is very common in many large software...
Mark Brodie, Sheng Ma, Guy M. Lohman, Laurent Mign...
167
Voted
FOCS
1999
IEEE
15 years 10 months ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl
JMLR
2010
130views more  JMLR 2010»
15 years 1 months ago
A Regularization Approach to Nonlinear Variable Selection
In this paper we consider a regularization approach to variable selection when the regression function depends nonlinearly on a few input variables. The proposed method is based o...
Lorenzo Rosasco, Matteo Santoro, Sofia Mosci, Ales...