334 search results - page 12 / 67 » A New Parallel Algorithm for Generalized LR Parsing |
74
Voted
OSDI
1996
ACM
15 years 28 days ago
1996
ACM
High-performance I/O systems depend on prefetching and caching in order to deliver good performance to applications. These two techniques have generally been considered in isolati...
110
click to vote
PLDI
2011
ACM
14 years 2 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
CLUSTER
2009
IEEE
15 years 6 months ago
2009
IEEE
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
100
click to vote
EMNLP
2007
15 years 1 months ago
2007
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text. We argue that bootstrapping a parser is most promis...
92
Voted
HPDC
2010
IEEE
15 years 21 days ago
2010
IEEE
This paper proposes a cache hierarchy that enables Web search engines to efficiently process user queries. The different caches in the hierarchy are used to store pieces of data w...