Sciweavers

1298 search results - page 70 / 260
» The online set cover problem
Sort
View
ACCV
2009
Springer
16 years 1 months ago
An Online Framework for Learning Novel Concepts over Multiple Cues
Abstract. We propose an online learning algorithm to tackle the problem of learning under limited computational resources in a teacher-student scenario, over multiple visual cues. ...
Luo Jie, Francesco Orabona, Barbara Caputo
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
15 years 12 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
WIOPT
2006
IEEE
16 years 11 days 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...
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
16 years 6 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 10 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