Sciweavers

791 search results - page 41 / 159
» Approximating the Maximum Sharing Problem
Sort
View
TNN
2008
182views more  TNN 2008»
13 years 7 months ago
Large-Scale Maximum Margin Discriminant Analysis Using Core Vector Machines
Abstract--Large-margin methods, such as support vector machines (SVMs), have been very successful in classification problems. Recently, maximum margin discriminant analysis (MMDA) ...
Ivor Wai-Hung Tsang, András Kocsor, James T...
ACL
2010
13 years 5 months ago
Viterbi Training for PCFGs: Hardness Results and Competitiveness of Uniform Initialization
We consider the search for a maximum likelihood assignment of hidden derivations and grammar weights for a probabilistic context-free grammar, the problem approximately solved by ...
Shay B. Cohen, Noah A. Smith
COLT
2006
Springer
13 years 11 months ago
Unifying Divergence Minimization and Statistical Inference Via Convex Duality
Abstract. In this paper we unify divergence minimization and statistical inference by means of convex duality. In the process of doing so, we prove that the dual of approximate max...
Yasemin Altun, Alexander J. Smola
CORR
2011
Springer
179views Education» more  CORR 2011»
12 years 11 months ago
Approximating minimum-power edge-multicovers
Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by appli...
Nachshon Cohen, Zeev Nutov
ADHOCNOW
2008
Springer
14 years 2 months ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...