Sciweavers

493 search results - page 21 / 99
» The oracle penalty method
Sort
View
ANOR
2011
169views more  ANOR 2011»
13 years 17 days ago
Predetermined intervals for start times of activities in the stochastic project scheduling problem
This paper proposes a new methodology to schedule activities in projects with stochastic activity durations. The main idea is to determine for each activity an interval in which th...
Illana Bendavid, Boaz Golany
ICCV
2007
IEEE
14 years 11 months ago
Multi-Object Tracking Through Clutter Using Graph Cuts
The standard graph cut technique is a robust method for globally optimal image segmentations. However, because of its global nature, it is prone to capture outlying areas similar ...
Allen Tannenbaum, James G. Malcolm, Yogesh Rathi
JMLR
2010
104views more  JMLR 2010»
13 years 3 months ago
Increasing Feature Selection Accuracy for L1 Regularized Linear Models
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...
Abhishek Jaiantilal, Gregory Z. Grudic
ESORICS
2005
Springer
14 years 2 months ago
Machine-Checked Security Proofs of Cryptographic Signature Schemes
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
Sabrina Tarento
SAC
2003
ACM
14 years 2 months ago
WebSOGO: A Global Ontology for Describing Web Sources
Based on the limitations raised by existing approaches in the context of the Semantic Web, we propose a formalism, Web Sources Global Ontology (WebSOGO), a data meta-model for the...
Edna Ruckhaus, Maria-Esther Vidal