Sciweavers

2383 search results - page 87 / 477
» Finding Representative Set from Massive Data
Sort
View
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
14 years 11 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
14 years 7 months ago
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
Bolin Ding, David Lo, Jiawei Han, Siau-Cheng Khoo
CORR
2007
Springer
96views Education» more  CORR 2007»
14 years 10 months ago
Exact Cover with light
We suggest a new, unconventional, way for solving the YES/NO version of the Exact Cover problem by using the massive parallelism of light. The idea is to build a device which can ...
Mihai Oltean, Oana Muntean
IPMI
1999
Springer
15 years 11 months ago
MEG Source Imaging Using Multipolar Expansions
We describe the use of truncated multipolar expansions for producing dynamic images of cortical neural activation from measurements of the magnetoencephalogram. We use a signal-sub...
John C. Mosher, Richard M. Leahy, David W. Shattuc...
ICAPR
2005
Springer
15 years 3 months ago
Missing Data Estimation Using Polynomial Kernels
Abstract. In this paper, we deal with the problem of partially observed objects. These objects are defined by a set of points and their shape variations are represented by a statis...
Maxime Berar, Michel Desvignes, Gérard Bail...