Sciweavers

1760 search results - page 37 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
BMCBI
2006
146views more  BMCBI 2006»
13 years 7 months ago
Optimized Particle Swarm Optimization (OPSO) and its application to artificial neural network training
Background: Particle Swarm Optimization (PSO) is an established method for parameter optimization. It represents a population-based adaptive optimization technique that is influen...
Michael Meissner, Michael Schmuker, Gisbert Schnei...
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
14 years 1 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
PAKDD
2009
ACM
263views Data Mining» more  PAKDD 2009»
14 years 2 months ago
Spatial Weighting for Bag-of-Visual-Words and Its Application in Content-Based Image Retrieval
It is a challenging and important task to retrieve images from a large and highly varied image data set based on their visual contents. Problems like how to fill the semantic gap b...
Xin Chen, Xiaohua Hu, Xiajiong Shen
FCT
2009
Springer
14 years 2 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
14 years 28 days ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz