1389 search results - page 56 / 278 » Improved Approximation Algorithms for Label Cover Problems |
140
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
138
Voted
LREC
2008
15 years 4 months ago
2008
This article is interested in the problem of the linguistic content of a speech corpus. Depending on the target task, the phonological and linguistic content of the corpus is cont...
102
Voted
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract—We introduce schema covering, the problem of identifying easily understandable common objects for describing large and complex schemas. Defining transformations between...
127
click to vote
CEAS
2006
Springer
15 years 6 months ago
2006
Springer
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
128
Voted
DIS
2009
Springer
15 years 9 months ago
2009
Springer
Within-network regression addresses the task of regression in partially labeled networked data where labels are sparse and continuous. Data for inference consist of entities associ...