Sciweavers

994 search results - page 57 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
96
Voted
RECOMB
2004
Springer
16 years 1 months ago
Perfect phylogeny and haplotype assignment
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
Eran Halperin, Richard M. Karp
148
Voted
WIOPT
2006
IEEE
15 years 6 months ago
Scheduling sensor activity for point information coverage in wireless sensor networks
Abstract— An important application of wireless sensor networks is to perform the monitoring missions, for example, to monitor some targets of interests at all times. Sensors are ...
Bang Wang, Kee Chaing Chua, Vikram Srinivasan, Wei...
MFCS
2009
Springer
15 years 5 months ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
120
Voted
AINA
2009
IEEE
15 years 7 months ago
Quantifying Artifacts of Virtualization: A Framework for Mirco-Benchmarks
One of the novel benefits of virtualization is the ability to emulate many hosts with a single physical machine. This approach is often used to support at-scale testing for large...
Chris Matthews, Yvonne Coady, Stephen Neville
109
Voted
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
16 years 1 months ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang