Sciweavers

373 search results - page 30 / 75
» On the Iterated Hairpin Completion
Sort
View
ISSTA
1989
ACM
15 years 3 months ago
The Logic of Propagation in the Inscape Environment
The Inscape Environment research project addresses issues in supporting the development of large systems by large numbers of programmers. One aspect of this research is the ‘‘...
D. Perry
FSEN
2007
Springer
15 years 3 months ago
Test Selection Criteria for Quantifier-Free First-Order Specifications
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulae. Test cases are modeled as ground formulae and any spe...
Marc Aiguier, Agnès Arnould, Pascale Le Gal...
ICDM
2007
IEEE
169views Data Mining» more  ICDM 2007»
15 years 3 months ago
Efficient Discovery of Frequent Approximate Sequential Patterns
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
INTERACT
2007
15 years 1 months ago
EMA-Tactons: Vibrotactile External Memory Aids in an Auditory Display
Abstract. Exploring any new data set always starts with gathering overview information. When this process is done non-visually, interactive sonification techniques have proved to b...
Johan Kildal, Stephen A. Brewster
TIT
2008
103views more  TIT 2008»
14 years 11 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah