Sciweavers

837 search results - page 43 / 168
» Distributed RAID - A New Multiple Copy Algorithm
Sort
View
AAAI
2006
13 years 10 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
14 years 2 months ago
Combining partitions by probabilistic label aggregation
Data clustering represents an important tool in exploratory data analysis. The lack of objective criteria render model selection as well as the identification of robust solutions...
Tilman Lange, Joachim M. Buhmann
IPPS
1997
IEEE
14 years 1 months ago
A Randomized Sorting Algorithm on the BSP model
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
Alexandros V. Gerbessiotis, Constantinos J. Siniol...
SIGMETRICS
2002
ACM
161views Hardware» more  SIGMETRICS 2002»
13 years 8 months ago
Performance study of dispatching algorithms in multi-tier web architectures
The number and heterogeneity of requests to Web sites are increasing also because the Web technology is becoming the preferred interface for information systems. Many systems host...
Mauro Andreolini, Michele Colajanni, Ruggero Morse...
SIGECOM
2010
ACM
156views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
Robust mechanisms for risk-averse sellers
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
Mukund Sundararajan, Qiqi Yan