Sciweavers

740 search results - page 14 / 148
» FAST Extended Release
Sort
View
SPIRE
2010
Springer
13 years 8 months ago
Fast Bit-Parallel Matching for Network and Regular Expressions
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura
CAISE
2003
Springer
14 years 3 months ago
Exp-DB: Fast Development of Information Systems for Experiment Tracking
Bioinformatics research groups require information systems keeping track of experiments and their results. However, current solutions are often ad-hoc, difficult to maintain, exten...
Nomair A. Naeem, Stéphane Raymond, Anne Pou...
FSEN
2009
Springer
14 years 4 months ago
Modular Schedulability Analysis of Concurrent Objects in Creol
We present an automata theoretic framework for modular schedulability analysis of real time asynchronous objects modeled in the language Creol. In previous work we analyzed the sch...
Frank S. de Boer, Tom Chothia, Mohammad Mahdi Jagh...
ASPDAC
2004
ACM
76views Hardware» more  ASPDAC 2004»
14 years 3 months ago
A fast method to derive minimum SOPs for decomposable functions
- This paper shows that divide-and-conquer derives a minimum sum-of-products expression (MSOP) of functions that have an AND bi-decomposition when at least one of the subfunctions ...
Tsutomu Sasao, Jon T. Butler
PODS
2004
ACM
109views Database» more  PODS 2004»
14 years 10 months ago
On the Complexity of Optimal K-Anonymity
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
Adam Meyerson, Ryan Williams