Sciweavers

6300 search results - page 1128 / 1260
» We have it easy, but do we have it right
Sort
View
ADCM
1998
132views more  ADCM 1998»
15 years 1 months ago
Numerical solution of generalized Lyapunov equations
Two e cient methods for solving generalized Lyapunov equations and their implementations in FORTRAN 77 are presented. The rst one is a generalization of the Bartels{Stewart method...
Thilo Penzl
CVPR
2009
IEEE
1351views Computer Vision» more  CVPR 2009»
16 years 8 months ago
Support Vector Machines in Face Recognition with Occlusions
Support Vector Machines (SVM) are one of the most useful techniques in classification problems. One clear example is face recognition. However, SVM cannot be applied when the fe...
Aleix M. Martínez, Hongjun Jia
CVPR
2007
IEEE
16 years 3 months ago
Graph Cut Based Optimization for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
Olga Veksler
ICCV
2003
IEEE
16 years 3 months ago
Dominant Sets and Hierarchical Clustering
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
Massimiliano Pavan, Marcello Pelillo
ICDE
2009
IEEE
131views Database» more  ICDE 2009»
16 years 3 months ago
Exploring a Few Good Tuples from Text Databases
Information extraction from text databases is a useful paradigm to populate relational tables and unlock the considerable value hidden in plain-text documents. However, information...
Alpa Jain, Divesh Srivastava
« Prev « First page 1128 / 1260 Last » Next »