315 search results - page 4 / 63 » Algebraic Lower Bounds for Computing on Encrypted Data |
RECOMB
2005
Springer
15 years 9 months ago
2005
Springer
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
RECOMB
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
STACS
2009
Springer
15 years 2 months ago
2009
Springer
ABSTRACT. This paper gives a brief overview of computation models for data stream processing, and it introduces a new model for multi-pass processing of multiple streams, the so-ca...
67
Voted
FOSSACS
2004
Springer
15 years 2 months ago
2004
Springer
More than a decade ago, Moller and Tofts published their seminal work on relating processes that are annotated with lower time bounds, with respect to speed. Their paper has left o...
85
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is...