5214 search results - page 367 / 1043 » The Online Specialization Problem |
200
click to vote
SIGMOD
2000
ACM
15 years 11 months ago
2000
ACM
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
166
click to vote
ICCV
1999
IEEE
15 years 11 months ago
1999
IEEE
:We formulate structure from motion as a Bayesian inference problem, and use a Markov chain Monte Carlo sampler to sample the posterior on this problem. This results in a method th...
170
click to vote
ICSM
1996
IEEE
15 years 11 months ago
1996
IEEE
It is well known that the extensive use of preprocessors can lead to serious maintenance problems. However, these tools are still heavily used by developers and maintainers to imp...
205
click to vote
CAIP
2007
Springer
15 years 10 months ago
2007
Springer
Fracture of the bone is a very serious medical condition. In clinical practice, a tired radiologist has been found to miss fracture cases after looking through many images containi...
189
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...