Sciweavers

5105 search results - page 751 / 1021
» Approximate Structural Consistency
Sort
View
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
16 years 7 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
CHI
2005
ACM
16 years 7 months ago
Design and analysis of delimiters for selection-action pen gesture phrases in scriboli
We present a quantitative analysis of delimiters for pen gestures. A delimiter is "something different" in the input stream that a computer can use to determine the stru...
François Guimbretière, Gonzalo Ramos...
CADE
2008
Springer
16 years 7 months ago
Proving Group Protocols Secure Against Eavesdroppers
Security protocols are small programs designed to ensure properties such as secrecy of messages or authentication of parties in a hostile environment. In this paper we investigate ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
16 years 6 months ago
Keyword query cleaning using hidden Markov models
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
Ken Q. Pu
SIGMOD
2004
ACM
88views Database» more  SIGMOD 2004»
16 years 6 months ago
Using Reasoning to Guide Annotation with Gene Ontology Terms in GOAT
High-quality annotation of biological data is central to bioinformatics. Annotation using terms from ontologies provides reliable computational access to data. The Gene Ontology (...
Michael Bada, Daniele Turi, Robin McEntire, Robert...