Sciweavers

574 search results - page 56 / 115
» Approximation Algorithms for Free-Label Maximization
Sort
View
FOCS
2006
IEEE
14 years 2 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
COCOON
2008
Springer
13 years 10 months ago
Spectrum Bidding in Wireless Networks and Related
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the self...
Xiang-Yang Li, Ping Xu, ShaoJie Tang, Xiaowen Chu
EMNLP
2008
13 years 10 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
INTERSPEECH
2010
13 years 3 months ago
A factorial sparse coder model for single channel source separation
We propose a probabilistic factorial sparse coder model for single channel source separation in the magnitude spectrogram domain. The mixture spectrogram is assumed to be the sum ...
Robert Peharz, Michael Stark, Franz Pernkopf, Yann...
ICALP
2010
Springer
14 years 1 months ago
The Positive Semidefinite Grothendieck Problem with Rank Constraint
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
Jop Briët, Fernando Mário de Oliveira ...