Sciweavers

741 search results - page 115 / 149
» A Note on the Use of Independent Sets for the k-SAT Problem
Sort
View
CIKM
2011
Springer
12 years 8 months ago
Towards feature selection in network
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
Quanquan Gu, Jiawei Han
IJSI
2008
156views more  IJSI 2008»
13 years 8 months ago
Co-Training by Committee: A Generalized Framework for Semi-Supervised Learning with Committees
Many data mining applications have a large amount of data but labeling data is often difficult, expensive, or time consuming, as it requires human experts for annotation. Semi-supe...
Mohamed Farouk Abdel Hady, Friedhelm Schwenker
HPCC
2009
Springer
13 years 6 months ago
Graph-Based Task Replication for Workflow Applications
Abstract--The Grid is an heterogeneous and dynamic environment which enables distributed computation. This makes it a technology prone to failures. Some related work uses replicati...
Raúl Sirvent, Rosa M. Badia, Jesús L...
BMCBI
2011
13 years 3 months ago
OrthoInspector: comprehensive orthology analysis and visual exploration
Background: The accurate determination of orthology and inparalogy relationships is essential for comparative sequence analysis, functional gene annotation and evolutionary studie...
Benjamin Linard, Julie D. Thompson, Olivier Poch, ...
IACR
2011
196views more  IACR 2011»
12 years 8 months ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
Gilad Asharov, Abhishek Jain, Daniel Wichs