Sciweavers

1477 search results - page 66 / 296
» Random Convex Programs
Sort
View
ASPLOS
2010
ACM
14 years 3 months ago
A randomized scheduler with probabilistic guarantees of finding bugs
This paper presents a randomized scheduler for finding concurrency bugs. Like current stress-testing methods, it repeatedly runs a given test program with supplied inputs. Howeve...
Sebastian Burckhardt, Pravesh Kothari, Madanlal Mu...
SRDS
2003
IEEE
14 years 2 months ago
Transparent Runtime Randomization for Security
A large class of security attacks exploit software implementation vulnerabilities such as unchecked buffers. This paper proposes Transparent Runtime Randomization (TRR), a general...
Jun Xu, Zbigniew Kalbarczyk, Ravishankar K. Iyer
ACML
2009
Springer
14 years 23 days ago
Max-margin Multiple-Instance Learning via Semidefinite Programming
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
Yuhong Guo
MP
2002
85views more  MP 2002»
13 years 8 months ago
Generalized Goal Programming: polynomial methods and applications
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
Emilio Carrizosa, Jörg Fliege
MP
2010
81views more  MP 2010»
13 years 7 months ago
Lifting inequalities: a framework for generating strong cuts for nonlinear programs
In this paper, we propose lifting techniques for generating strong cuts for nonlinear programs that are globally-valid. The theory is geometric and provides intuition into lifting...
Jean-Philippe P. Richard, Mohit Tawarmalani