780 search results - page 27 / 156 » Cost-Sharing Approximations for h |
DAM
2008
14 years 11 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
CIKM
2010
Springer
14 years 9 months ago
2010
Springer
Pseudo-relevance feedback (PRF) improves search quality by expanding the query using terms from high-ranking documents from an initial retrieval. Although PRF can often result in ...
CDC
2010
IEEE
2010
IEEE
Convergence of discrete-time approximations of constrained linear-quadratic optimal control problems
14 years 6 months ago
Abstract-- Continuous-time linear constrained optimal control problems are in practice often solved using discretization techniques, e.g. in model predictive control (MPC). This re...
VLDB
2005
ACM
15 years 4 months ago
2005
ACM
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
74
Voted
WWW
2007
ACM
15 years 11 months ago
2007
ACM
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...