709 search results - page 59 / 142 » On LR(k)-Parsers of Polynomial Size |
RECOMB
2001
Springer
15 years 10 months ago
2001
Springer
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
SPIRE
2009
Springer
15 years 4 months ago
2009
Springer
Collaborative filtering (CF) shares information between users to provide each with recommendations. Previous work suggests using sketching techniques to handle massive data sets i...
AAIM
2008
Springer
15 years 4 months ago
2008
Springer
We consider the setting of a device that obtains it energy from a battery and some regenerative source such as a solar cell. We consider the speed scaling problem of scheduling a c...
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...