99 search results - page 4 / 20 » Improved bounds and new techniques for Davenport-Schinzel se... |
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
BMCBI
2008
13 years 8 months ago
2008
Background: Protein domains present some of the most useful information that can be used to understand protein structure and functions. Recent research on protein domain boundary ...
JCT
2010
13 years 6 months ago
2010
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Compositional performance analysis iteratively alternates local scheduling analysis techniques and output event model propagation between system components to enable performance a...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...