Sciweavers

5169 search results - page 719 / 1034
» Locality approximation using time
Sort
View
156
Voted
TITB
2008
204views more  TITB 2008»
15 years 4 months ago
A Cryptographic Approach to Securely Share and Query Genomic Sequences
To support large-scale biomedical research projects, organizations need to share person-specific genomic sequences without violating the privacy of their data subjects. In the past...
Murat Kantarcioglu, Wei Jiang, Ying Liu, Bradley M...
147
Voted
AI
2011
Springer
15 years 2 days ago
Expressive markets for donating to charities
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as a bargaining chip to induce other parties interested in the charity to donate ...
Vincent Conitzer, Tuomas Sandholm
CGO
2011
IEEE
14 years 8 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...
131
Voted
ISSRE
2006
IEEE
15 years 11 months ago
Queuing Models for Field Defect Resolution Process
This paper explores a novel application of queuing theory to the corrective software maintenance problem to support quantitative balancing between resources and responsiveness. In...
Swapna S. Gokhale, Robert E. Mullen
SPAA
1997
ACM
15 years 9 months ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller