1356 search results - page 134 / 272 » Some New Results on Inverse Sorting Problems |
RIVF
2007
13 years 10 months ago
2007
— Results of queries by personal names often contain documents related to several people because of the namesake problem. In order to differentiate documents related to different...
ECCV
2008
Springer
14 years 11 months ago
2008
Springer
This paper addresses the segmentation from an image of entities that have the form of a `network', i.e. the region in the image corresponding to the entity is composed of bran...
BMCBI
2011
13 years 19 days ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
We present a novel variant of the RANSAC algorithm
that is much more efficient, in particular when dealing with
problems with low inlier ratios. Our algorithm assumes
that there...
FOCS
2002
IEEE
14 years 2 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...