2127 search results - page 412 / 426 » Computing large matchings fast |
SIGCOMM
2006
ACM
14 years 1 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
RAID
2005
Springer
14 years 27 days ago
2005
Springer
To detect and defend against Internet worms, researchers have long hoped to have a safe convenient environment to unleash and run real-world worms for close observation of their in...
VLDB
2004
ACM
14 years 23 days ago
2004
ACM
Today’s world of increasingly dynamic computing environments naturally results in more and more data being available as fast streams. Applications such as stock market analysis,...
CP
2003
Springer
14 years 19 days ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
SIGMOD
2010
ACM
14 years 7 days ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...