Sciweavers

1118 search results - page 179 / 224
» Convex Optimization
Sort
View
ICML
2004
IEEE
14 years 8 months ago
Surrogate maximization/minimization algorithms for AdaBoost and the logistic regression model
Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. There are...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung
KDD
2002
ACM
119views Data Mining» more  KDD 2002»
14 years 8 months ago
Evaluating classifiers' performance in a constrained environment
In this paper, we focus on methodology of finding a classifier with a minimal cost in presence of additional performance constraints. ROCCH analysis, where accuracy and cost are i...
Anna Olecka
ASPDAC
2009
ACM
161views Hardware» more  ASPDAC 2009»
14 years 2 months ago
Risk aversion min-period retiming under process variations
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
Jia Wang, Hai Zhou
GLOBECOM
2007
IEEE
14 years 2 months ago
Analysis of the Impact of the Number of Reporting Nodes on Sensor Networks Lifetime
— Energy-ef ciency is one of the major concerns in wireless sensor networks since it impacts the network lifetime. In this paper, we investigate the relationship between sensor n...
Fatma Bouabdallah, Nizar Bouabdallah, Raouf Boutab...
ICCSA
2004
Springer
14 years 1 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson