2593 search results - page 267 / 519 » On Two Problems of Nano-PLA Design |
WWW
2010
ACM
15 years 4 months ago
2010
ACM
Key-value stores (KVSs) are the most prevalent storage systems for large scale web services. As they do not have the structural complexities of RDBMSs, they are more efficient. In...
ACSAC
2003
IEEE
15 years 4 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
DATE
2000
IEEE
15 years 3 months ago
2000
IEEE
In this paper we address the problem of designing very high throughput finite state machines (FSMs). The presence of loops in sequential circuits prevents a straightforward and g...
COLING
2010
14 years 6 months ago
2010
We use robust and fast Finite-State Machines (FSMs) to solve scriptural translation problems. We describe a phonetico-morphotactic pivot UIT (universal intermediate transcription)...
APSEC
2006
IEEE
15 years 5 months ago
2006
IEEE
We hypothesize that certain program complexities and difficulties to realize reuse potentials have their roots in weak mechanisms for generic design of today’s programming techn...