334 search results - page 42 / 67 » A New Parallel Algorithm for Generalized LR Parsing |
120
click to vote
ICDCS
2007
IEEE
15 years 8 months ago
2007
IEEE
Security and reliability of network protocol implementations are essential for communication services. Most of the approaches for verifying security and reliability, such as forma...
113
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
147
Voted
WWW
2011
ACM
14 years 9 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
131
click to vote
PODC
2006
ACM
15 years 8 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
118
click to vote
ICDCS
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper presents a new method to control the delay performance for high rate heterogeneous real-time traffic flows based on a novel traffic control algorithm which is a gene...