Sciweavers

4047 search results - page 96 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
DGCI
2003
Springer
15 years 9 months ago
Stability in Discrete Tomography: Linear Programming, Additivity and Convexity
The problem of reconstructing finite subsets of the integer lattice from X-rays has been studied in discrete mathematics and applied in several fields like image processing, data...
Sara Brunetti, Alain Daurat
PRL
2011
14 years 7 months ago
A Bayes-true data generator for evaluation of supervised and unsupervised learning methods
Benchmarking pattern recognition, machine learning and data mining methods commonly relies on real-world data sets. However, there are some disadvantages in using real-world data....
Janick V. Frasch, Aleksander Lodwich, Faisal Shafa...
WSC
2008
15 years 6 months ago
The mathematics of continuous-variable simulation optimization
Continuous-variable simulation optimization problems are those optimization problems where the objective function is computed through stochastic simulation and the decision variab...
Sujin Kim, Shane G. Henderson
110
Voted
ICPR
2008
IEEE
15 years 11 months ago
Image segmentation towards natural clusters
To find how many clusters in a sample set is an old yet unsolved problem in unsupervised clustering. Many segmentation methods require the user to specify the number of regions in...
Zhigang Tan, Nelson Hon Ching Yung
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
13 years 7 months ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx