Sciweavers

4047 search results - page 197 / 810
» The Discrete Basis Problem
Sort
View
112
Voted
APPT
2007
Springer
15 years 9 months ago
An Efficient Construction of Node Disjoint Paths in OTIS Networks
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
Weidong Chen, Wenjun Xiao, Behrooz Parhami
155
Voted
AMFG
2005
IEEE
164views Biometrics» more  AMFG 2005»
15 years 5 months ago
Pose-Encoded Spherical Harmonics for Robust Face Recognition Using a Single Image
Abstract. Face recognition under varying pose is a challenging problem, especially when illumination variations are also present. Under Lambertian model, spherical harmonics repres...
Zhanfeng Yue, Wenyi Zhao, Rama Chellappa
154
Voted
TNN
2010
176views Management» more  TNN 2010»
14 years 10 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
COMPGEOM
2004
ACM
15 years 9 months ago
On distinct distances from a vertex of a convex polygon
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...
Adrian Dumitrescu
ACRI
2004
Springer
15 years 9 months ago
Block Encryption Using Reversible Cellular Automata
Cellular automata (CA) are highly parallel and discrete dynamical systems, whose behavior is completely specified in terms of a local relation. They were successfully applied for s...
Marcin Seredynski, Pascal Bouvry