Sciweavers

18306 search results - page 358 / 3662
» Algorithmics in Exponential Time
Sort
View
SDM
2004
SIAM
212views Data Mining» more  SDM 2004»
15 years 8 months ago
Clustering with Bregman Divergences
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...
SIGMETRICS
2008
ACM
150views Hardware» more  SIGMETRICS 2008»
15 years 6 months ago
Performance of random medium access control, an asymptotic approach
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
Charles Bordenave, David McDonald, Alexandre Prout...
EOR
2006
107views more  EOR 2006»
15 years 6 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
250
Voted
EUROCOLT
1999
Springer
15 years 11 months ago
Averaging Expert Predictions
We consider algorithms for combining advice from a set of experts. In each trial, the algorithm receives the predictions of the experts and produces its own prediction. A loss func...
Jyrki Kivinen, Manfred K. Warmuth
STACS
2010
Springer
16 years 1 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...