Sciweavers

137 search results - page 7 / 28
» Applying Decomposition Methods to Crossword Puzzle Problems
Sort
View
WIOPT
2010
IEEE
13 years 7 months ago
K-shell decomposition for dynamic complex networks
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
Daniele Miorandi, Francesco De Pellegrini
ICCV
2011
IEEE
12 years 8 months ago
Learning to Cluster Using High Order Graphical Models with Latent Variables
This paper proposes a very general max-margin learning framework for distance-based clustering. To this end, it formulates clustering as a high order energy minimization problem w...
Nikos Komodakis
GRC
2010
IEEE
13 years 9 months ago
Optimal Factorization of Three-Way Binary Data
We present a problem of factor analysis of three-way binary data, i.e. data described by a 3-dimensional binary matrix I, describing a relationship between objects, attributes, an...
Radim Belohlávek, Vilém Vychodil
CVPR
2004
IEEE
14 years 10 months ago
Linear Projection Methods in Face Recognition under Unconstrained Illuminations: A Comparative Study
Face recognition under unconstrained illuminations (FR/I) received extensive study because of the existence of illumination subspace. [2] presented a study on the comparison betwe...
Qi Li, Jieping Ye, Chandra Kambhamettu
MOC
2000
70views more  MOC 2000»
13 years 8 months ago
Extrapolation methods and derivatives of limits of sequences
Let {Sm} be an infinite sequence whose limit or antilimit S can be approximated very efficiently by applying a suitable extrapolation method E0 to {Sm}. Assume that the Sm and henc...
Avram Sidi