Sciweavers

3995 search results - page 776 / 799
» Linearization of hybrid processes
Sort
View
STACS
1992
Springer
14 years 1 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
PERCOM
2010
ACM
14 years 1 months ago
AutoGait: A mobile platform that accurately estimates the distance walked
—AutoGait is a mobile platform that autonomously discovers a user’s walking profile and accurately estimates the distance walked. The discovery is made by utilizing the GPS in...
Dae-Ki Cho, Min Mun, Uichin Lee, Williams J. Kaise...
EDBT
2009
ACM
145views Database» more  EDBT 2009»
14 years 1 months ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...
CSB
2004
IEEE
208views Bioinformatics» more  CSB 2004»
14 years 1 months ago
Pair Stochastic Tree Adjoining Grammars for Aligning and Predicting Pseudoknot RNA Structures
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...
Hiroshi Matsui, Kengo Sato, Yasubumi Sakakibara
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
14 years 1 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...