Sciweavers

6142 search results - page 903 / 1229
» The Complexity of Partition Functions
Sort
View
WWW
2004
ACM
16 years 7 months ago
OntoWeaver-S: Integrating Web Services into Data-Intensive Web Sites
Designing web sites is a complex task. Ad-hoc rapid prototyping easily leads to unsatisfactory results, e.g. poor maintainability and extensibility. However, existing web design f...
Yuangui Lei, Enrico Motta, John Domingue
188
Voted
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 7 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
RECOMB
2009
Springer
16 years 7 months ago
COE: A General Approach for Efficient Genome-Wide Two-Locus Epistasis Test in Disease Association Study
The availability of high density single nucleotide polymorphisms (SNPs) data has made genome-wide association study computationally challenging. Twolocus epistasis (gene-gene inter...
Xiang Zhang, Feng Pan, Yuying Xie, Fei Zou, Wei Wa...
SAS
2009
Springer
172views Formal Methods» more  SAS 2009»
16 years 7 months ago
Type Analysis for JavaScript
JavaScript is the main scripting language for Web browsers, and it is essential to modern Web applications. Programmers have started using it for writing complex applications, but ...
Anders Møller, Peter Thiemann, Simon Holm J...
CHES
2009
Springer
230views Cryptology» more  CHES 2009»
16 years 7 months ago
Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...
David Kammler, Diandian Zhang, Dominik Auras, Gerd...