503 search results - page 10 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
COR
2008
14 years 9 months ago
2008
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
121
click to vote
IPCO
2001
14 years 10 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
ICML
2010
IEEE
2010
IEEE
Unsupervised Risk Stratification in Clinical Datasets: Identifying Patients at Risk of Rare Outcomes
14 years 10 months ago
Most existing algorithms for clinical risk stratification rely on labeled training data. Collecting this data is challenging for clinical conditions where only a small percentage ...
84
Voted
ADC
2003
Springer
15 years 2 months ago
2003
Springer
The mining of informative rules calls for methods that include different attributes (e.g., weights, quantities, multipleconcepts) suitable for the context of the problem to be an...
82
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Given a convex region in the plane, and a sweep-line as a tool, what is best way to reduce the region to a single point by a sequence of sweeps? The problem of sweeping points by ...