Sciweavers

334 search results - page 28 / 67
» A New Parallel Algorithm for Generalized LR Parsing
Sort
View
SPAA
1994
ACM
15 years 6 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
BMCBI
2010
132views more  BMCBI 2010»
15 years 2 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
PPOPP
2009
ACM
16 years 3 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
RANLP
2003
15 years 3 months ago
Structured parameter estimation for LFG-DOP
Despite its state-of-the-art performance, the Data Oriented Parsing (DOP) model has been shown to suffer from biased parameter estimation, and the good performance seems more the ...
Mary Hearne, Khalil Sima'an
SIGIR
2003
ACM
15 years 7 months ago
Structured use of external knowledge for event-based open domain question answering
One of the major problems in question answering (QA) is that the queries are either too brief or often do not contain most relevant terms in the target corpus. In order to overcom...
Hui Yang, Tat-Seng Chua, Shuguang Wang, Chun-Keat ...