Sciweavers

5115 search results - page 652 / 1023
» On Randomized Lanczos Algorithms
Sort
View
JDA
2010
88views more  JDA 2010»
15 years 5 months ago
Greedy colorings for the binary paintshop problem
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
Hadis Amini, Frédéric Meunier, H&eac...
PVLDB
2010
84views more  PVLDB 2010»
15 years 5 months ago
Processing Top-k Join Queries
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
Minji Wu, Laure Berti-Equille, Amélie Maria...
WDAG
2010
Springer
184views Algorithms» more  WDAG 2010»
15 years 5 months ago
Fast Asynchronous Consensus with Optimal Resilience
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
Ittai Abraham, Marcos Kawazoe Aguilera, Dahlia Mal...
CISC
2009
Springer
148views Cryptology» more  CISC 2009»
15 years 4 months ago
A DAA Scheme Requiring Less TPM Resources
Abstract. Direct anonymous attestation (DAA) is a special digital signature primitive, which provides a balance between signer authentication and privacy. One of the most interesti...
Liqun Chen
EUROPAR
2009
Springer
15 years 4 months ago
A Least-Resistance Path in Reasoning about Unstructured Overlay Networks
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...
Giorgos Georgiadis, Marina Papatriantafilou