Sciweavers

820 search results - page 85 / 164
» Inducing Temporal Graphs
Sort
View
126
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Unsupervised vocabulary discovery using non-negative matrix factorization with graph regularization
In this paper, we present a model for unsupervised pattern discovery using non-negative matrix factorization (NMF) with graph regularization. Though the regularization can be appl...
Meng Sun, Hugo Van hamme
112
Voted
ICIP
2007
IEEE
16 years 4 months ago
Automated Segmentation of Torn Frames using the Graph Cuts Technique
Film Tear is a form of degradation in archived film and is the physical ripping of the film material. Tear causes displacement of a region of the degraded frame and the loss of im...
David Corrigan, Naomi Harte, Anil C. Kokaram
103
Voted
SIBGRAPI
2007
IEEE
15 years 9 months ago
Bipartite graph matching for video clip localization
Video clip localization consists in identifying real positions of a specific video clip in a video stream. To cope with this problem, we propose a new approach considering the ma...
Zenilton Kleber G. do Patrocínio Jr., Silvi...
JGT
2010
158views more  JGT 2010»
15 years 1 months ago
Cubicity of interval graphs and the claw number
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × Ib, where ea...
Abhijin Adiga, L. Sunil Chandran
104
Voted
WEA
2009
Springer
123views Algorithms» more  WEA 2009»
15 years 9 months ago
Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes
We propose new practical algorithms to find degree-relaxed variants of cliques called s-plexes. An s-plex denotes a vertex subset in a graph inducing a subgraph where every vertex...
Hannes Moser, Rolf Niedermeier, Manuel Sorge