315 search results - page 41 / 63 » Algebraic Lower Bounds for Computing on Encrypted Data |
116
Voted
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
90
Voted
ICCS
2005
Springer
15 years 6 months ago
2005
Springer
: String barcoding is a recently introduced technique for genomic based identification of microorganisms. In this paper we describe the engineering of highly scalable algorithms fo...
135
click to vote
ICDCS
2000
IEEE
15 years 5 months ago
2000
IEEE
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
122
click to vote
DCOSS
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
105
Voted
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...