4041 search results - page 184 / 809 » time 2009 |
146
click to vote
ARC
2009
Springer
16 years 1 months ago
2009
Springer
The parallel branching program machine (PBM128) consists of 128 branching program machines (BMs) and a programmable interconnection. To represent logic functions on BMs, we use qua...
168
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
The Active Buffer project is part of the CBM (compressed baryonic matter) experiment and takes advantage of the DPR (dynamic partial reconfiguration) technology, in which a dynam...
148
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Straight-line programs (SLPs) offer powerful text compression by representing a text T[1, u] in terms of a restricted context-free grammar of n rules, so that T can be r...
189
click to vote
ACL
2009
15 years 4 months ago
2009
Conventional sentence compression methods employ a syntactic parser to compress a sentence without changing its meaning. However, the reference compressions made by humans do not ...
181
click to vote
ICPP
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...