Sciweavers

2924 search results - page 339 / 585
» Lower Bounds in Distributed Computing
Sort
View
145
Voted
RECOMB
2008
Springer
16 years 5 months ago
Algorithms for Joint Optimization of Stability and Diversity in Planning Combinatorial Libraries of Chimeric Proteins
Abstract. In engineering protein variants by constructing and screening combinatorial libraries of chimeric proteins, two complementary and competing goals are desired: the new pro...
Wei Zheng, Alan M. Friedman, Chris Bailey-Kellogg
152
Voted
ANCS
2007
ACM
15 years 8 months ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley
172
Voted
COMPGEOM
2007
ACM
15 years 6 months ago
Between umbra and penumbra
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
Julien Demouth, Olivier Devillers, Hazel Everett, ...
127
Voted
ICML
2006
IEEE
16 years 5 months ago
Estimating relatedness via data compression
We show that it is possible to use data compression on independently obtained hypotheses from various tasks to algorithmically provide guarantees that the tasks are sufficiently r...
Brendan Juba
143
Voted
HIPC
2007
Springer
15 years 10 months ago
Structuring Unstructured Peer-to-Peer Networks
Flooding is a fundamental building block of unstructured peer-to-peer (P2P) systems. In this paper, we investigate techniques to improve the performance of flooding. In particular...
Stefan Schmid, Roger Wattenhofer