Sciweavers

1709 search results - page 105 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
ICDE
2007
IEEE
211views Database» more  ICDE 2007»
15 years 11 months ago
Document Representation and Dimension Reduction for Text Clustering
Increasingly large text datasets and the high dimensionality associated with natural language create a great challenge in text mining. In this research, a systematic study is cond...
M. Mahdi Shafiei, Singer Wang, Roger Zhang, Evange...
123
Voted
ESANN
2008
15 years 6 months ago
Do we need experts for time series forecasting?
This study examines a selection of off-the-shelf forecasting and forecast combination algorithms with a focus on assessing their practical relevance by drawing conclusions for non-...
Christiane Lemke, Bogdan Gabrys
151
Voted
SSDBM
2003
IEEE
141views Database» more  SSDBM 2003»
15 years 10 months ago
The ed-tree: An Index for Large DNA Sequence Databases
The growing interest in genomic research has caused an explosive growth in the size of DNA databases making it increasely challenging to perform searches on them. In this paper, w...
Zhenqiang Tan, Xia Cao, Beng Chin Ooi, Anthony K. ...
135
Voted
SIGMETRICS
2008
ACM
117views Hardware» more  SIGMETRICS 2008»
15 years 4 months ago
Epidemic live streaming: optimal performance trade-offs
Several peer-to-peer systems for live streaming have been recently deployed (e.g. CoolStreaming, PPLive, SopCast). These all rely on distributed, epidemic-style dissemination mech...
Thomas Bonald, Laurent Massoulié, Fabien Ma...
154
Voted
IPPS
2003
IEEE
15 years 10 months ago
A Fast Algorithm for the Exhaustive Analysis of 12-Nucleotide-Long DNA Sequences. Applications to Human Genomics
We have developed a new algorithm that allows the exhaustive determination of words of up to 12 nucleotides in DNA sequences. It is fast enough as to be used at a genomic scale ru...
Vicente Arnau, Ignacio Marín