Sciweavers

15254 search results - page 2882 / 3051
» A k
Sort
View
CASES
2005
ACM
15 years 8 months ago
Anomalous path detection with hardware support
Embedded systems are being deployed as a part of critical infrastructures and are vulnerable to malicious attacks due to internet accessibility. Intrusion detection systems have b...
Tao Zhang, Xiaotong Zhuang, Santosh Pande, Wenke L...
CIKM
2006
Springer
15 years 8 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
CLEANDB
2006
ACM
142views Database» more  CLEANDB 2006»
15 years 8 months ago
QUEST: QUery-driven Exploration of Semistructured Data with ConflicTs and Partial Knowledge
An important reality when integrating scientific data is the fact that data may often be "missing", partially specified, or conflicting. Therefore, in this paper, we pre...
Yan Qi 0002, K. Selçuk Candan, Maria Luisa ...
CODES
2006
IEEE
15 years 8 months ago
Architectural support for safe software execution on embedded processors
The lack of memory safety in many popular programming languages, including C and C++, has been a cause for great concern in the realm of software reliability, verification, and mo...
Divya Arora, Anand Raghunathan, Srivaths Ravi, Nir...
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 8 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
« Prev « First page 2882 / 3051 Last » Next »