Sciweavers

3466 search results - page 2 / 694
» Fast computation of special resultants
Sort
View
FOCS
2006
IEEE
13 years 11 months ago
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
László Lovász, Santosh Vempal...
ACSAC
2007
IEEE
13 years 11 months ago
Tampering with Special Purpose Trusted Computing Devices: A Case Study in Optical Scan E-Voting
Special purpose trusted computing devices are currently being deployed to offer many services for which the general purpose computing paradigm is unsuitable. The nature of the ser...
Aggelos Kiayias, Laurent Michel, Alexander Russell...
CCS
2009
ACM
14 years 5 days ago
Privacy-preserving genomic computation through program specialization
In this paper, we present a new approach to performing important classes of genomic computations (e.g., search for homologous genes) that makes a significant step towards privacy...
Rui Wang, XiaoFeng Wang, Zhou Li, Haixu Tang, Mich...
ICFP
1997
ACM
13 years 9 months ago
Implementing Bit-addressing with Specialization
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
Scott Draves
EUROSYS
2010
ACM
14 years 2 months ago
A Comprehensive Scheduler for Asymmetric Multicore Systems
Symmetric-ISA (instruction set architecture) asymmetricperformance multicore processors were shown to deliver higher performance per watt and area for codes with diverse architect...
Juan Carlos Saez, Manuel Prieto Matias, Alexandra ...