Sciweavers

2814 search results - page 111 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
ACST
2006
15 years 3 months ago
Distributed hierarchical document clustering
This paper investigates the applicability of distributed clustering technique, called RACHET [1], to organize large sets of distributed text data. Although the authors of RACHET c...
Debzani Deb, M. Muztaba Fuad, Rafal A. Angryk
ICARIS
2009
Springer
15 years 9 months ago
On AIRS and Clonal Selection for Machine Learning
AIRS is an immune-inspired supervised learning algorithm that has been shown to perform competitively on some common datasets. Previous analysis of the algorithm consists almost ex...
Chris McEwan, Emma Hart
PR
2011
14 years 9 months ago
A variational Bayesian methodology for hidden Markov models utilizing Student's-t mixtures
The Student’s-t hidden Markov model (SHMM) has been recently proposed as a robust to outliers form of conventional continuous density hidden Markov models, trained by means of t...
Sotirios Chatzis, Dimitrios I. Kosmopoulos
ICNP
2002
IEEE
15 years 7 months ago
An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
Dahai Xu, Chunming Qiao, Yizhi Xiong
ICALP
2004
Springer
15 years 7 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella