Sciweavers

8636 search results - page 1649 / 1728
» How Developers Copy
Sort
View
KDD
2010
ACM
232views Data Mining» more  KDD 2010»
14 years 2 months ago
Discovering frequent patterns in sensitive data
Discovering frequent patterns from data is a popular exploratory technique in data mining. However, if the data are sensitive (e.g. patient health records, user behavior records) ...
Raghav Bhaskar, Srivatsan Laxman, Adam Smith, Abhr...
ESWS
2007
Springer
14 years 2 months ago
Imprecise SPARQL: Towards a Unified Framework for Similarity-Based Semantic Web Tasks
This proposal explores a unified framework to solve Semantic Web tasks that often require similarity measures, such as RDF retrieval, ontology alignment, and semantic service match...
Christoph Kiefer
RTA
2010
Springer
14 years 2 months ago
Automata for Data Words and Data Trees
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
Mikolaj Bojanczyk
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
14 years 2 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
FCCM
2007
IEEE
122views VLSI» more  FCCM 2007»
14 years 2 months ago
Reconfigurable Computing Cluster (RCC) Project: Investigating the Feasibility of FPGA-Based Petascale Computing
While medium- and large-sized computing centers have increasingly relied on clusters of commodity PC hardware to provide cost-effective capacity and capability, it is not clear th...
Ron Sass, William V. Kritikos, Andrew G. Schmidt, ...
« Prev « First page 1649 / 1728 Last » Next »