Sciweavers

823 search results - page 49 / 165
» Stateful Subset Cover
Sort
View
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
14 years 2 months ago
Frequent regular itemset mining
Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an...
Salvatore Ruggieri
ECIR
2010
Springer
13 years 11 months ago
A Case for Automatic System Evaluation
Ranking a set retrieval systems according to their retrieval effectiveness without relying on relevance judgments was first explored by Soboroff et al. [13]. Over the years, a numb...
Claudia Hauff, Djoerd Hiemstra, Leif Azzopardi, Fr...
CIDR
2011
290views Algorithms» more  CIDR 2011»
13 years 1 months ago
Towards a One Size Fits All Database Architecture
We propose a new type of database system coined OctopusDB. Our approach suggests a unified, one size fits all data processing architecture for OLTP, OLAP, streaming systems, and...
Jens Dittrich, Alekh Jindal
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
14 years 5 months ago
Incorporating graceful degradation into embedded system design
In this work, the focus is put on the behavior of a system in case a fault occurs that disables the system from executing its applications. Instead of executing a random subset of...
Michael Glaß, Martin Lukasiewycz, Christian ...
IFIP
2009
Springer
14 years 4 months ago
Towards a Type System for Security APIs
Security API analysis typically only considers a subset of an API’s functions, with results bounded by the number of function calls. Furthermore, attacks involving partial leakag...
Gavin Keighren, David Aspinall, Graham Steel