2168 search results - page 413 / 434 » Randomized Algorithms and Complexity Theory |
85
Voted
MM
2010
ACM
14 years 12 months ago
2010
ACM
It has been theoretically shown that performing coding in networked systems, including Reed-Solomon codes, fountain codes, and random network coding, has a clear advantage with re...
124
click to vote
BMCBI
2008
14 years 11 months ago
2008
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
127
click to vote
BMCBI
2007
14 years 11 months ago
2007
Background: The functions of human cells are carried out by biomolecular networks, which include proteins, genes, and regulatory sites within DNA that encode and control protein e...
TOG
2008
14 years 11 months ago
2008
We introduce 4PCS, a fast and robust alignment scheme for 3D point sets that uses wide bases, which are known to be resilient to noise and outliers. The algorithm allows registeri...
128
click to vote
TKDE
2011
14 years 6 months ago
2011
—The current peer-to-peer (P2P) content distribution systems are constricted by their simple on-demand content discovery mechanism. The utility of these systems can be greatly en...