Sciweavers

2314 search results - page 101 / 463
» Minimal Partitions of a Graph
Sort
View
457
Voted
CVPR
2012
IEEE
13 years 5 months ago
A Unified Framework for Event Summarization and Rare Event Detection
A novel approach for event summarization and rare event detection is proposed. Unlike conventional methods that deal with event summarization and rare event detection independently...
Junseok Kwon and Kyoung Mu Lee
137
Voted
NIPS
2004
15 years 5 months ago
Proximity Graphs for Clustering and Manifold Learning
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
Miguel Á. Carreira-Perpiñán, ...
117
Voted
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 3 months ago
Quasi-randomness of graph balanced cut properties
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
Hao Huang, Choongbum Lee
129
Voted
DCG
2002
66views more  DCG 2002»
15 years 3 months ago
Generation of Oriented Matroids - A Graph Theoretical Approach
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretica...
Lukas Finschi, Komei Fukuda
131
Voted
ICTAC
2004
Springer
15 years 9 months ago
Minimal Spanning Set for Coverage Testing of Interactive Systems
A model-based approach for minimization of test sets for interactive systems is introduced. Test cases are efficiently generated and selected to cover the behavioral model and the ...
Fevzi Belli, Christof J. Budnik