Sciweavers

4378 search results - page 229 / 876
» On the Complexity of Ordered Colourings
Sort
View
TCOM
2011
114views more  TCOM 2011»
15 years 1 months ago
Iterative Receivers Based on Subblock Processing for Phase Noise Compensation in OFDM Systems
—An iterative algorithm employing decision feedback provided by either an equalizer or a channel decoder is proposed in order to compensate for the phase noise resulting from imp...
Myung-Kyu Lee, Kyeongcheol Yang, Kyungwhoon Cheun
ICASSP
2011
IEEE
14 years 10 months ago
Using F0 to constrain the unit selection Viterbi network
The goal of the work described here is to limit the computation needed in unit selection Viterbi search for text-to-speech synthesis. The broader goal is to improve speech quality...
Alistair Conkie, Ann K. Syrdal
PLDI
2012
ACM
13 years 9 months ago
Dynamic synthesis for relaxed memory models
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
Feng Liu, Nayden Nedev, Nedyalko Prisadnikov, Mart...
TON
2012
13 years 9 months ago
Scalable Lookahead Regular Expression Detection System for Deep Packet Inspection
—Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable t...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
EDBT
2012
ACM
395views Database» more  EDBT 2012»
13 years 9 months ago
Data management with SAPs in-memory computing engine
We present some architectural and technological insights on SAP’s HANA database and derive research challenges for future enterprise application development. The HANA database m...
Joos-Hendrik Boese, Cafer Tosun, Christian Mathis,...