Sciweavers

2434 search results - page 259 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
EDBT
2009
ACM
156views Database» more  EDBT 2009»
15 years 8 months ago
Efficient skyline retrieval with arbitrary similarity measures
A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors...
Deepak P, Prasad M. Deshpande, Debapriyo Majumdar,...
KDD
2010
ACM
232views Data Mining» more  KDD 2010»
15 years 8 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...
ICDM
2005
IEEE
125views Data Mining» more  ICDM 2005»
15 years 9 months ago
A Thorough Experimental Study of Datasets for Frequent Itemsets
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to...
Frédéric Flouvat, Fabien De Marchi, ...
ICASSP
2009
IEEE
15 years 10 months ago
Using collective information in semi-supervised learning for speech recognition
Training accurate acoustic models typically requires a large amount of transcribed data, which can be expensive to obtain. In this paper, we describe a novel semi-supervised learn...
Balakrishnan Varadarajan, Dong Yu, Li Deng, Alex A...
144
Voted
ECRTS
1998
IEEE
15 years 8 months ago
Using exact feasibility tests for allocating real-time tasks in multiprocessor systems
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
Sergio Saez, Joan Vila i Carbó, Alfons Cres...