Sciweavers

5221 search results - page 886 / 1045
» An On-line Problem Database
Sort
View
DOCENG
2009
ACM
16 years 29 days ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...
AICCSA
2008
IEEE
292views Hardware» more  AICCSA 2008»
16 years 29 days ago
Enumeration of maximal clique for mining spatial co-location patterns
This paper presents a systematic approach to mine colocation patterns in Sloan Digital Sky Survey (SDSS) data. SDSS Data Release 5 (DR5) contains 3.6 TB of data. Availability of s...
Ghazi Al-Naymat
BIBM
2008
IEEE
172views Bioinformatics» more  BIBM 2008»
16 years 28 days ago
Boosting Methods for Protein Fold Recognition: An Empirical Comparison
Protein fold recognition is the prediction of protein’s tertiary structure (Fold) given the protein’s sequence without relying on sequence similarity. Using machine learning t...
Yazhene Krishnaraj, Chandan K. Reddy
COLCOM
2008
IEEE
16 years 28 days ago
Defending against Attribute-Correlation Attacks in Privacy-Aware Information Brokering
Nowadays, increasing needs for information sharing arise due to extensive collaborations among organizations. Organizations desire to provide data access to their collaborators whi...
Fengjun Li, Bo Luo, Peng Liu, Anna Cinzia Squiccia...
HASE
2008
IEEE
16 years 28 days ago
Low Cost Secure Computation for the General Client-Server Computation Model
Due to the large number of attacks on open networks, information theft becomes a more and more severe problem. Secure computation can offer highly assured confidentiality protecti...
Liangliang Xiao, I-Ling Yen, Farokh B. Bastani