Sciweavers

2192 search results - page 231 / 439
» Algorithms for Challenging Motif Problems
Sort
View
ICNP
2005
IEEE
15 years 9 months ago
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
Yao Zhao, Bo Li, Qian Zhang, Yan Chen, Wenwu Zhu
CVPR
2010
IEEE
15 years 9 months ago
Adaptive Generic Learning for Face Recognition from a Single Sample per Person
Real-world face recognition systems often have to face the single sample per person (SSPP) problem, that is, only a single training sample for each person is enrolled in the datab...
Yu Su, Shiguang Shan, Xilin Chen, wen Gao
SIGMOD
2010
ACM
274views Database» more  SIGMOD 2010»
15 years 8 months ago
K-isomorphism: privacy preserving network publication against structural attacks
Serious concerns on privacy protection in social networks have been raised in recent years; however, research in this area is still in its infancy. The problem is challenging due ...
James Cheng, Ada Wai-Chee Fu, Jia Liu
EDBT
2009
ACM
85views Database» more  EDBT 2009»
15 years 8 months ago
Expressive, yet tractable XML keys
Constraints are important for a variety of XML recommendations and applications. Consequently, there are numerous opportunities for advancing the treatment of XML semantics. In pa...
Sven Hartmann, Sebastian Link
CVPR
2010
IEEE
15 years 8 months ago
Bayes Optimal Kernel Discriminant Analysis
Kernel methods provide an efficient mechanism to derive nonlinear algorithms. In classification problems as well as in feature extraction, kernel-based approaches map the original...
Di You, Aleix Martinez