Sciweavers

526 search results - page 88 / 106
» On the Number of Minimal Addition Chains
Sort
View
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
14 years 7 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
ICDCS
2012
IEEE
13 years 1 days ago
Combining Partial Redundancy and Checkpointing for HPC
Today’s largest High Performance Computing (HPC) systems exceed one Petaflops (1015 floating point operations per second) and exascale systems are projected within seven years...
James Elliott, Kishor Kharbas, David Fiala, Frank ...
VLDB
2007
ACM
138views Database» more  VLDB 2007»
15 years 10 months ago
CADS: Continuous Authentication on Data Streams
We study processing and authentication of long-running queries on outsourced data streams. In this scenario, a data owner (DO) constantly transmits its data to a service provider ...
Stavros Papadopoulos, Yin Yang, Dimitris Papadias
ISCC
2005
IEEE
15 years 3 months ago
Optimizing the Reliable Distribution of Large Files within CDNs
Abstract Content Delivery Networks (CDNs) provide an efficient support for serving http and streaming media content while minimizing the network impact of content delivery as well...
Ludmila Cherkasova
CADE
1998
Springer
15 years 1 months ago
System Description: leanK 2.0
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
Bernhard Beckert, Rajeev Goré