4212 search results - page 748 / 843 » On Compressible Pairings and Their Computation |
146
click to vote
ICRA
2006
IEEE
16 years 13 days ago
2006
IEEE
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
159
click to vote
PODC
2003
ACM
15 years 11 months ago
2003
ACM
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
181
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
191
click to vote
TCS
2011
15 years 1 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
223
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: Pairwise sequence alignment methods are widely used in biological research. The increasing number of sequences is perceived as one of the upcoming challenges for seque...