1594 search results - page 10 / 319 » An Algorithm to Compute Collusion Paths |
WADS
1995
Springer
15 years 6 months ago
1995
Springer
We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and non–zero propaga...
NDSS
1998
IEEE
15 years 6 months ago
1998
IEEE
Protocol failures are presented for two timestamping schemes. These failures emphasize the importance and di culty of implementing a secure protocol even though there exist secure...
101
click to vote
RECOMB
2005
Springer
16 years 2 months ago
2005
Springer
Abstract. The interpretation of large-scale protein network data depends on our ability to identify significant sub-structures in the data, a computationally intensive task. Here w...
154
click to vote
FOCS
2010
IEEE
15 years 12 days ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
116
click to vote
TCBB
2008
15 years 2 months ago
2008
The representation of a genome by oligonucleotide probes is a prerequisite for the analysis of many of its basic properties, such as transcription factor binding sites, chromosomal...