Sciweavers

337 search results - page 42 / 68
» Semidefinite Programming Based Approximation Algorithms
Sort
View
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
13 years 11 months ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann
ICDE
2009
IEEE
163views Database» more  ICDE 2009»
14 years 9 months ago
Distance-Based Representative Skyline
Given an integer k, a representative skyline contains the k skyline points that best describe the tradeoffs among different dimensions offered by the full skyline. Although this to...
Yufei Tao, Ling Ding, Xuemin Lin, Jian Pei
NIPS
2007
13 years 9 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
ESANN
2006
13 years 9 months ago
Optimal design of hierarchical wavelet networks for time-series forecasting
The purpose of this study is to identify the Hierarchical Wavelet Neural Networks (HWNN) and select important input features for each sub-wavelet neural network automatically. Base...
Yuehui Chen, Bo Yang, Ajith Abraham
ICML
2010
IEEE
13 years 8 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein