Sciweavers

469 search results - page 85 / 94
» Using Secret Sharing for Searching in Encrypted Data
Sort
View
WWW
2006
ACM
14 years 8 months ago
Knowledge modeling and its application in life sciences: a tale of two ontologies
High throughput glycoproteomics, similar to genomics and proteomics, involves extremely large volumes of distributed, heterogeneous data as a basis for identification and quantifi...
Satya Sanket Sahoo, Christopher Thomas, Amit P. Sh...
WWW
2007
ACM
14 years 8 months ago
Crawling multiple UDDI business registries
As Web services proliferate, size and magnitude of UDDI Business Registries (UBRs) are likely to increase. The ability to discover Web services of interest then across multiple UB...
Eyhab Al-Masri, Qusay H. Mahmoud
CIKM
2008
Springer
13 years 9 months ago
A sparse gaussian processes classification framework for fast tag suggestions
Tagged data is rapidly becoming more available on the World Wide Web. Web sites which populate tagging services offer a good way for Internet users to share their knowledge. An in...
Yang Song, Lu Zhang 0007, C. Lee Giles
WWW
2004
ACM
14 years 8 months ago
Meteor-s web service annotation framework
The World Wide Web is emerging not only as an infrastructure for data, but also for a broader variety of resources that are increasingly being made available as Web services. Rele...
Abhijit A. Patil, Swapna A. Oundhakar, Amit P. She...
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
14 years 1 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey