628 search results - page 62 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
111
click to vote
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
We pose the problem of tracing traitors, who have colluded to circumvent a multimedia fingerprinting system, as a sparse underdetermined linear problem. We propose a range of det...
117
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
172
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
158
click to vote
SPAA
1999
ACM
15 years 7 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
113
click to vote
GLVLSI
2003
IEEE
15 years 8 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...