Sciweavers

1272 search results - page 78 / 255
» The Set Cover with Pairs Problem
Sort
View
EC
2008
153views ECommerce» more  EC 2008»
15 years 11 days ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
120
Voted
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
15 years 6 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
149
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...
110
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
FGR
2004
IEEE
132views Biometrics» more  FGR 2004»
15 years 4 months ago
Expand Training Set for Face Detection by GA Re-sampling
Data collection for both training and testing a classifier is a tedious but essential step towards face detection and recognition. All of the statistical methods suffer from this ...
Jie Chen, Xilin Chen, Wen Gao