Sciweavers

4208 search results - page 270 / 842
» Challenges in Evaluating Distributed Algorithms
Sort
View
SPAA
2010
ACM
15 years 11 months ago
Collaborative scoring with dishonest participants
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti R...
IPSN
2005
Springer
15 years 11 months ago
Tracking on a graph
Abstract— This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of...
Songhwai Oh, Shankar Sastry
ICPR
2008
IEEE
16 years 7 months ago
K-means clustering of proportional data using L1 distance
We present a new L1-distance-based k-means clustering algorithm to address the challenge of clustering high-dimensional proportional vectors. The new algorithm explicitly incorpor...
Bonnie K. Ray, Hisashi Kashima, Jianying Hu, Monin...
NIPS
2008
15 years 7 months ago
Efficient Sampling for Gaussian Process Inference using Control Variables
Sampling functions in Gaussian process (GP) models is challenging because of the highly correlated posterior distribution. We describe an efficient Markov chain Monte Carlo algori...
Michalis Titsias, Neil D. Lawrence, Magnus Rattray
SPAA
2010
ACM
15 years 11 months ago
Towards optimizing energy costs of algorithms for shared memory architectures
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
Vijay Anand Korthikanti, Gul Agha