Sciweavers

823 search results - page 49 / 165
» Stateful Subset Cover
Sort
View
124
Voted
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
15 years 7 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
119
Voted
ECIR
2010
Springer
15 years 5 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...
165
Voted
CIDR
2011
290views Algorithms» more  CIDR 2011»
14 years 7 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»
15 years 10 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 ...
112
Voted
IFIP
2009
Springer
15 years 10 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