Sciweavers

380 search results - page 48 / 76
» A Categorical Setting for Lower Complexity
Sort
View
IPPS
2006
IEEE
15 years 3 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
AAAI
2007
15 years 1 days ago
Ungreedy Methods for Chinese Deterministic Dependency Parsing
Deterministic dependency parsing has often been regarded as an efficient parsing algorithm while its parsing accuracy is a little lower than the best results reported by more comp...
Xiangyu Duan, Jun Zhao, Bo Xu
CORR
2006
Springer
94views Education» more  CORR 2006»
14 years 9 months ago
Single-Symbol-Decodable Differential Space-Time Modulation Based on QO-STBC
We show that Minimum-Decoding-Complexity QuasiOrthogonal Space-Time Block Code (MDC-QOSTBC) can be used to form a new differential space-time modulation (DSTM) scheme to provide f...
Chau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung
ICDE
1999
IEEE
101views Database» more  ICDE 1999»
15 years 11 months ago
Index Merging
Indexes play a vital role in decision support systems by reducing the cost of answering complex queries. A popular methodology for choosing indexes that is adopted by database adm...
Surajit Chaudhuri, Vivek R. Narasayya
ICALP
1992
Springer
15 years 1 months ago
Fast Integer Merging on the EREW PRAM
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
Torben Hagerup