Sciweavers

12551 search results - page 2218 / 2511
» Informative Discriminant Analysis
Sort
View
MP
1998
109views more  MP 1998»
15 years 6 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
NAR
1998
161views more  NAR 1998»
15 years 6 months ago
Touring protein fold space with Dali/FSSP
The FSSP database and its new supplement, the Dali Domain Dictionary, present a continuously updated classification of all known 3D protein structures. The classification is deriv...
Liisa Holm, Chris Sander
SIAMCOMP
1998
85views more  SIAMCOMP 1998»
15 years 6 months ago
Separator-Based Sparsification II: Edge and Vertex Connectivity
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
David Eppstein, Zvi Galil, Giuseppe F. Italiano, T...
PRL
2002
146views more  PRL 2002»
15 years 6 months ago
Face recognition with one training image per person
: Recently, a method called (PC)2 A was proposed to deal with face recognition with one training image per person. As an extension of the standard eigenface technique, (PC)2 A comb...
Jianxin Wu, Zhi-Hua Zhou
SAC
2002
ACM
15 years 6 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...
« Prev « First page 2218 / 2511 Last » Next »