Sciweavers

SIROCCO
2008
14 years 11 days ago
On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms and presented an algorithm with three states for the problem of mutual exclusion on a ring of processors. ...
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
SDM
2008
SIAM
119views Data Mining» more  SDM 2008»
14 years 11 days ago
An Efficient Local Algorithm for Distributed Multivariate Regression in Peer-to-Peer Networks
This paper offers a local distributed algorithm for multivariate regression in large peer-to-peer environments. The algorithm is designed for distributed inferencing, data compact...
Kanishka Bhaduri, Hillol Kargupta
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
14 years 11 days ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
Ryan Riegel, Alexander Gray, Gordon Richards
MASCOTS
2007
14 years 11 days ago
A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks
— We propose a hierarchical Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is an extension of our previous Connec...
Deniz Cokuslu, Kayhan Erciyes
ISCAPDCS
2007
14 years 11 days ago
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
NIPS
2008
14 years 11 days ago
Online Prediction on Large Diameter Graphs
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
Mark Herbster, Guy Lever, Massimiliano Pontil
NIPS
2008
14 years 11 days ago
Inferring rankings under constrained sensing
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...
Srikanth Jagabathula, Devavrat Shah
NIPS
2008
14 years 11 days ago
An Online Algorithm for Maximizing Submodular Functions
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
Matthew J. Streeter, Daniel Golovin
NIPS
2008
14 years 11 days 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
IMECS
2007
14 years 11 days ago
Metamodel-Assisted Global Search Using a Probing Technique
—This paper presents a new metamodel-assisted metaheuristic algorithm for optimisation problems involving computationally expensive simulations. The algorithm, called Global Prob...
Anna Persson, Henrik Grimm, Amos Ng