230 search results - page 33 / 46 » Minimum Spanning Tree Problem with Label Selection |
140
click to vote
MLDM
2005
Springer
15 years 8 months ago
2005
Springer
In the context of large databases, data preparation takes a greater importance : instances and explanatory attributes have to be carefully selected. In supervised learning, instanc...
135
Voted
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
114
click to vote
SIGECOM
2003
ACM
15 years 8 months ago
2003
ACM
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...
157
click to vote
CISS
2007
IEEE
15 years 7 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
146
Voted
EMNLP
2010
15 years 1 months ago
2010
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...