1299 search results - page 89 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
RECOMB
1998
Springer
15 years 2 months ago
1998
Springer
The task of computing molecular structure from combinations of experimental and theoretical constraints is expensive because of the large number of estimated parameters (the 3D co...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
Although steady progress has been made in recent stereo algorithms, producing accurate results in the neighborhood of depth discontinuities remains a challenge. Moreover, among th...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the c...