Sciweavers

3122 search results - page 125 / 625
» Storing Semistructured Data with STORED
Sort
View
VLDB
2002
ACM
106views Database» more  VLDB 2002»
13 years 8 months ago
Approximate Frequency Counts over Data Streams
We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. A...
Gurmeet Singh Manku, Rajeev Motwani
OTM
2010
Springer
13 years 6 months ago
Towards Evaluating GRASIM for Ontology-Based Data Matching
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
Yan Tang
OTM
2010
Springer
13 years 6 months ago
Towards Using Semantic Decision Tables for Organizing Data Semantics
In the ITEA2 Do-It-Yourself Smart Experiences project (DIY-SE), we are required to design an ontology-based ambient computing environment to support users to DIY their personalized...
Yan Tang
BIOSIG
2009
104views Biometrics» more  BIOSIG 2009»
13 years 6 months ago
A Note on the Protection Level of Biometric Data in Electronic Passports
: Following regulations of the EU Council in 2004, the member states have deployed electronic passports according to ICAO standards. Such documents contain an embedded radio freque...
Harald Baier, Tobias Straub
EMNLP
2011
12 years 8 months ago
Approximate Scalable Bounded Space Sketch for Large Data NLP
We exploit sketch techniques, especially the Count-Min sketch, a memory, and time efficient framework which approximates the frequency of a word pair in the corpus without explic...
Amit Goyal, Hal Daumé III