Sciweavers

3946 search results - page 110 / 790
» The computational complexity of choice sets
Sort
View
PPOPP
1995
ACM
15 years 10 months ago
pC++/streams: a Library for I/O on Complex Distributed Data Structures
paper we describe d/streams, a language-independent abstraction with a small set of simple primitives for buffered I/O on distributed data-structures. We describe the interface an...
Jacob Gotwals, Suresh Srinivas, Dennis Gannon
VLDB
2005
ACM
118views Database» more  VLDB 2005»
15 years 12 months ago
Mining Compressed Frequent-Pattern Sets
A major challenge in frequent-pattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one ...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
FGCS
2007
172views more  FGCS 2007»
15 years 6 months ago
From access and integration to mining of secure genomic data sets across the Grid
The UK Department of Trade and Industry (DTI) funded BRIDGES project (Biomedical Research Informatics Delivered by Grid Enabled Services) has developed a Grid infrastructure to su...
Richard O. Sinnott
CSDA
2007
152views more  CSDA 2007»
15 years 6 months ago
Robust variable selection using least angle regression and elemental set sampling
In this paper we address the problem of selecting variables or features in a regression model in the presence of both additive (vertical) and leverage outliers. Since variable sel...
Lauren McCann, Roy E. Welsch
ICASSP
2009
IEEE
16 years 1 months ago
Robust-SL0 for stable sparse representation in noisy settings
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...
Armin Eftekhari, Massoud Babaie-Zadeh, Christian J...