Sciweavers

1964 search results - page 231 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
Towards a Theory of Robust Localization Against Malicious Beacon Nodes
—Localization in the presence of malicious beacon nodes is an important problem in wireless networks. Although significant progress has been made on this problem, some fundament...
Sheng Zhong, Murtuza Jadliwala, Shambhu J. Upadhya...
BMCBI
2010
132views more  BMCBI 2010»
13 years 8 months ago
Protein docking by Rotation-Based Uniform Sampling (RotBUS) with fast computing of intermolecular contact distance and residue d
Background: Protein-protein interactions are fundamental for the majority of cellular processes and their study is of enormous biotechnological and therapeutic interest. In recent...
Albert Solernou, Juan Fernández-Recio
WWW
2007
ACM
14 years 9 months ago
Combining classifiers to identify online databases
We address the problem of identifying the domain of online databases. More precisely, given a set F of Web forms automatically gathered by a focused crawler and an online database...
Luciano Barbosa, Juliana Freire
CCS
2009
ACM
14 years 3 months ago
Privacy-preserving genomic computation through program specialization
In this paper, we present a new approach to performing important classes of genomic computations (e.g., search for homologous genes) that makes a significant step towards privacy...
Rui Wang, XiaoFeng Wang, Zhou Li, Haixu Tang, Mich...
FGR
2004
IEEE
200views Biometrics» more  FGR 2004»
13 years 12 months ago
Using Random Subspace to Combine Multiple Features for Face Recognition
LDA is a popular subspace based face recognition approach. However, it often suffers from the small sample size problem. When dealing with the high dimensional face data, the LDA ...
Xiaogang Wang, Xiaoou Tang