ESA
2009
Springer
13 years 11 months ago
2009
Springer
We consider online algorithms for pull-based broadcast scheduling. In this setting there are n pages of information at a server and requests for pages arrive online. When the serv...
ERSHOV
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
Traditionally, collaborative filtering (CF) algorithms used for recommendation operate on complete knowledge. This makes these algorithms hard to employ in a decentralized contex...
ATVA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivate...
ATC
2009
Springer
13 years 11 months ago
2009
Springer
We present a resource management algorithm based upon guided “walks” within a system state space. Walks are guided via simple predictions of optimum behavior whose accuracy inc...
WEBI
2009
Springer
13 years 11 months ago
2009
Springer
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
WEBI
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, we propose a novel memory-based collaborative filtering recommendation algorithm. Our algorithm use a new metric named influence weight, which is adjusted with ze...
AUSAI
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we propose to use a distance metric based on user-preferences to efficiently find solutions for many-objective problems. In a user-preference based algorithm a decis...
ASIACRYPT
2009
Springer
13 years 11 months ago
2009
Springer
An r-collision for a function is a set of r distinct inputs with identical outputs. Actually finding r-collisions for a random map over a finite set of cardinality N requires at ...