Sciweavers

393 search results - page 59 / 79
» Convex Programming Methods for Global Optimization
Sort
View
WIMOB
2008
IEEE
14 years 1 months ago
Rate Allocation with Lifetime Maximization and Fairness for Data Aggregation in Sensor Networks
—We consider the rate allocation problem for data aggregation in wireless sensor networks with two objectives: 1) maximizing the lifetime of a local aggregation cluster and, 2) a...
Shouwen Lai, Binoy Ravindran, Hyeonjoong Cho
ECCV
2008
Springer
14 years 9 months ago
Constrained Maximum Likelihood Learning of Bayesian Networks for Facial Action Recognition
Probabilistic graphical models such as Bayesian Networks have been increasingly applied to many computer vision problems. Accuracy of inferences in such models depends on the quali...
Cassio Polpo de Campos, Yan Tong, Qiang Ji
IJCAI
2003
13 years 9 months ago
When Discriminative Learning of Bayesian Network Parameters Is Easy
Bayesian network models are widely used for discriminative prediction tasks such as classification. Usually their parameters are determined using 'unsupervised' methods ...
Hannes Wettig, Peter Grünwald, Teemu Roos, Pe...
WEA
2010
Springer
243views Algorithms» more  WEA 2010»
14 years 2 months ago
Experiments with a Feasibility Pump Approach for Nonconvex MINLPs
We present a new Feasibility Pump algorithm tailored for nonconvex Mixed Integer Nonlinear Programming problems. Differences with the previously proposed Feasibility Pump algorith...
Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti...
ICCV
2007
IEEE
14 years 9 months ago
An Invariant Large Margin Nearest Neighbour Classifier
The k-nearest neighbour (kNN) rule is a simple and effective method for multi-way classification that is much used in Computer Vision. However, its performance depends heavily on ...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...