Sciweavers

3466 search results - page 206 / 694
» Fast computation of special resultants
Sort
View
ASIACRYPT
2008
Springer
15 years 8 months ago
MPC vs. SFE : Unconditional and Computational Security
Abstract. In secure computation among a set P of players one considers an adversary who can corrupt certain players. The three usually considered types of corruption are active, pa...
Martin Hirt, Ueli M. Maurer, Vassilis Zikas
ISF
2008
210views more  ISF 2008»
15 years 6 months ago
Affective e-Learning in residential and pervasive computing environments
This article examines how emerging pervasive computing and affective computing technologies might enhance the adoption of ICT in e-Learning which takes place in the home and wider ...
Liping Shen, Victor Callaghan, Ruimin Shen
HIPC
2009
Springer
15 years 4 months ago
Comparing the performance of clusters, Hadoop, and Active Disks on microarray correlation computations
Abstract--Microarray-based comparative genomic hybridization (aCGH) offers an increasingly fine-grained method for detecting copy number variations in DNA. These copy number variat...
Jeffrey A. Delmerico, Nathanial A. Byrnes, Andrew ...
CIE
2007
Springer
16 years 26 days ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
BMCBI
2008
128views more  BMCBI 2008»
15 years 6 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich