Sciweavers

380 search results - page 29 / 76
» Efficient partial-duplicate detection based on sequence matc...
Sort
View
RECOMB
2004
Springer
14 years 9 months ago
Finding approximate tandem repeats in genomic sequences
An efficient algorithm is presented for detecting approximate tandem repeats in genomic sequences. The algorithm is based on a flexible statistical model which allows a wide range...
Ydo Wexler, Zohar Yakhini, Yechezkel Kashi, Dan Ge...

Publication
364views
14 years 3 months ago
CV-SLAM: A new ceiling vision-based SLAM technique
We propose a fast and robust CV-SLAM (Ceiling Vision –based Simultaneous Localization and Mapping) technique using a single ceiling vision sensor. The proposed algorithm is suita...
Woo Yeon Jeong (Seoul National University), Kyoung...
PR
2008
145views more  PR 2008»
13 years 9 months ago
Probabilistic suffix models for API sequence analysis of Windows XP applications
Given the pervasive nature of malicious mobile code (viruses, worms, etc.), developing statistical/structural models of code execution is of considerable importance. We investigat...
Geoffrey Mazeroff, Jens Gregor, Michael G. Thomaso...
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
14 years 9 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
SIGCOMM
2010
ACM
13 years 9 months ago
NetShield: massive semantics-based vulnerability signature matching for high-speed networks
Accuracy and speed are the two most important metrics for Network Intrusion Detection/Prevention Systems (NIDS/NIPSes). Due to emerging polymorphic attacks and the fact that in ma...
Zhichun Li, Gao Xia, Hongyu Gao, Yi Tang, Yan Chen...