628 search results - page 106 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
147
Voted
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
130
click to vote
TSP
2008
15 years 2 months ago
2008
Graphical models provide a powerful formalism for statistical signal processing. Due to their sophisticated modeling capabilities, they have found applications in a variety of fie...
145
Voted
AI
2002
Springer
15 years 2 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
120
click to vote
SPAA
2006
ACM
15 years 8 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
131
Voted
CIE
2007
Springer
15 years 8 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....