Sciweavers

1814 search results - page 210 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
BIOCOMP
2006
15 years 8 months ago
A Heuristic Approach to Scoring Gene Clustering Algorithms
In the past decades, many clustering algorithms have been proposed for the analysis of gene expression data, but little guidance is available to help choose among them. Given the ...
Longde Yin, Chun-Hsi Huang
CLUSTER
2006
IEEE
16 years 20 days ago
Automatic Clustering for Self-Organizing Grids
Computational grids have not scaled effectively due to administrative hurdles to resource and user participation. Most production grids are essentially multi-site supercomputer ce...
Weishuai Yang, Nael B. Abu-Ghazaleh, Michael J. Le...
KDD
2005
ACM
205views Data Mining» more  KDD 2005»
16 years 2 days ago
Feature bagging for outlier detection
Outlier detection has recently become an important problem in many industrial and financial applications. In this paper, a novel feature bagging approach for detecting outliers in...
Aleksandar Lazarevic, Vipin Kumar
LREC
2010
176views Education» more  LREC 2010»
15 years 8 months ago
There's no Data like More Data? Revisiting the Impact of Data Size on a Classification Task
In the paper we investigate the impact of data size on a Word Sense Disambiguation task (WSD). We question the assumption that the knowledge acquisition bottleneck, which is known...
Ines Rehbein, Josef Ruppenhofer
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
16 years 1 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi