Sciweavers

16404 search results - page 227 / 3281
» A set coverage problem
Sort
View
ICDT
2001
ACM
124views Database» more  ICDT 2001»
15 years 8 months ago
Mining for Empty Rectangles in Large Data Sets
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
Jeff Edmonds, Jarek Gryz, Dongming Liang, Ren&eacu...
BMVC
2001
15 years 6 months ago
Combining 3D Deformable Models and Level Set Methods for the Segmentation of Abdominal Aortic Aneurysms
In this paper we present a system that combines the benefits of 3D deformable models and level set methods for medical volume segmentation. Our 3D deformable model is a very comp...
Derek R. Magee, Andrew J. Bulpitt, Elizabeth Berry
IJCAI
2007
15 years 5 months ago
Learning to Identify Unexpected Instances in the Test Set
Traditional classification involves building a classifier using labeled training examples from a set of predefined classes and then applying the classifier to classify test instan...
Xiaoli Li, Bing Liu, See-Kiong Ng
178
Voted
CVPR
2008
IEEE
15 years 4 months ago
A similarity measure between unordered vector sets with application to image categorization
We present a novel approach to compute the similarity between two unordered variable-sized vector sets. To solve this problem, several authors have proposed to model each vector s...
Yan Liu, Florent Perronnin
JGAA
2006
127views more  JGAA 2006»
15 years 4 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...