Sciweavers

986 search results - page 148 / 198
» Algorithmic Lower Bounds for Problems Parameterized by Cliqu...
Sort
View
COLT
2010
Springer
13 years 5 months ago
Active Learning on Trees and Graphs
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
INFOCOM
2009
IEEE
14 years 2 months ago
Minimum Maximum Degree Publish-Subscribe Overlay Network Design
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
Melih Onus, Andréa W. Richa
DMKD
2003
ACM
148views Data Mining» more  DMKD 2003»
14 years 29 days ago
A symbolic representation of time series, with implications for streaming algorithms
The parallel explosions of interest in streaming data, and data mining of time series have had surprisingly little intersection. This is in spite of the fact that time series data...
Jessica Lin, Eamonn J. Keogh, Stefano Lonardi, Bil...
MP
2002
85views more  MP 2002»
13 years 7 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
14 years 2 months ago
Three Results on Frequency Assignment in Linear Cellular Networks
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
Marek Chrobak, Jiri Sgall