Sciweavers

3898 search results - page 61 / 780
» On the Bit Extraction Problem
Sort
View
ACL
2006
14 years 11 months ago
Extraction of Tree Adjoining Grammars from a Treebank for Korean
We present the implementation of a system which extracts not only lexicalized grammars but also feature-based lexicalized grammars from Korean Sejong Treebank. We report on some p...
Jungyeul Park
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
15 years 10 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
DDECS
2007
IEEE
93views Hardware» more  DDECS 2007»
15 years 4 months ago
Manifestation of Precharge Faults in High Speed DRAM Devices
Abstract: High speed DRAMs today suffer from an increased sensitivity to interference and noise problems. Signal integrity issues, caused by bit line and word line coupling, result...
Zaid Al-Ars, Said Hamdioui, Georgi Gaydadjiev
ICPP
2002
IEEE
15 years 2 months ago
Optimal Video Replication and Placement on a Cluster of Video-on-Demand Servers
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
Xiaobo Zhou, Cheng-Zhong Xu
ISAAC
2009
Springer
127views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
Laurent Bulteau, Guillaume Fertin, Irena Rusu