Sciweavers

2814 search results - page 77 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
14 years 1 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
FOCM
2008
140views more  FOCM 2008»
13 years 10 months ago
Online Gradient Descent Learning Algorithms
This paper considers the least-square online gradient descent algorithm in a reproducing kernel Hilbert space (RKHS) without explicit regularization. We present a novel capacity i...
Yiming Ying, Massimiliano Pontil
EOR
2007
110views more  EOR 2007»
13 years 10 months ago
A hierarchical ant based clustering algorithm and its use in three real-world applications
In this paper is presented a new model for data clustering, which is inspired from the selfassembly behavior of real ants. Real ants can build complex structures by connecting the...
Hanene Azzag, Gilles Venturini, Antoine Oliver, Ch...
BROADNETS
2007
IEEE
14 years 4 months ago
DATALITE: a distributed architecture for traffic analysis via light-weight traffic digest
-- In this paper, we propose DATALITE, a Distributed Architecture for Traffic Analysis via LIghtweight Traffic digEst, which introduces a set of new distributed algorithms and prot...
Wing Cheong Lau, Murali S. Kodialam, T. V. Lakshma...
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
14 years 10 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...