Sciweavers

1578 search results - page 138 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
ATMOS
2010
134views Optimization» more  ATMOS 2010»
13 years 8 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
CIVR
2005
Springer
130views Image Analysis» more  CIVR 2005»
14 years 2 months ago
Improvement on PCA and 2DPCA Algorithms for Face Recognition
Principle Component Analysis (PCA) technique is an important and well-developed area of image recognition and to date many linear discrimination methods have been put forward. Desp...
Vo Dinh Minh Nhat, Sungyoung Lee
VIP
2003
13 years 10 months ago
On the Structural Algorithm of Filtering Graphs for Layout
When the amount of information in visualization becomes large enough, users can not perceive all elements at the same time. This problem can be solved by removing parts of the inf...
Xiaodi Huang, Wei Lai
ICDCS
2007
IEEE
14 years 3 months ago
Secure Event Dissemination in Publish-Subscribe Networks
Abstract. Content-based publish-subscribe (pub-sub) systems are an emerging paradigm for building large-scale information delivery systems. Secure event dissemination in a pub-sub ...
Mudhakar Srivatsa, Ling Liu
NIPS
1997
13 years 10 months ago
EM Algorithms for PCA and SPCA
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
Sam T. Roweis