Sciweavers

2489 search results - page 29 / 498
» On the Subgroup Distance Problem
Sort
View
ORL
1998
116views more  ORL 1998»
13 years 7 months ago
Heuristic solution of the multisource Weber problem as a p-median problem
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Pierre Hansen, Nenad Mladenovic, Éric D. Ta...
ICCTA
2007
IEEE
13 years 11 months ago
New Distance Measure for Microarray Gene Expressions Using Linear Dynamic Range of Photo Multiplier Tube
This paper deals with a new distance measure for genes using their microarray expressions. The distance measure is called, "Maxrange distance", where an experiment speci...
Shubhra Sankar Ray, Sanghamitra Bandyopadhyay, San...
RECOMB
2010
Springer
13 years 5 months ago
Scaffold Filling under the Breakpoint Distance
Motivated by the trend of genome sequencing without completing the sequence of the whole genomes, Mu˜noz et al. recently studied the problem of filling an incomplete multichromos...
Haitao Jiang, Chunfang Zheng, David Sankoff, Binha...
FSTTCS
2009
Springer
14 years 2 months ago
Domination Problems in Nowhere-Dense Classes
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
Anuj Dawar, Stephan Kreutzer
ICCV
1998
IEEE
14 years 9 months ago
Minimizing Algebraic Error in Geometric Estimation Problems
This paper gives a widely applicable technique for solving many of the parameter estimation problems encountered in geometric computer vision. A commonly used approach is to minim...
Richard I. Hartley