Sciweavers

1068 search results - page 119 / 214
» Extremely randomized trees
Sort
View
ISMB
1993
13 years 11 months ago
Computationally Efficient Cluster Representation in Molecular Sequence Megaclassification
Molecular sequence megaclassification is a technique for automated protein sequence analysis and annotation. Implementation of the method has been limited by the need to store and...
David J. States, Nomi L. Harris, Lawrence Hunter
TPDS
2008
136views more  TPDS 2008»
13 years 10 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
JCB
1998
105views more  JCB 1998»
13 years 9 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
COR
2011
13 years 5 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
14 years 10 months ago
Systematic data selection to mine concept-drifting data streams
One major problem of existing methods to mine data streams is that it makes ad hoc choices to combine most recent data with some amount of old data to search the new hypothesis. T...
Wei Fan