Sciweavers

215 search results - page 18 / 43
» Online Bin Coloring
Sort
View
IPL
2000
111views more  IPL 2000»
15 years 1 months ago
On the performance of the first-fit coloring algorithm on permutation graphs
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
Stavros D. Nikolopoulos, Charis Papadopoulos
114
Voted
FOCS
2003
IEEE
15 years 7 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
119
Voted
GLVLSI
2009
IEEE
92views VLSI» more  GLVLSI 2009»
15 years 8 months ago
Online circuit reliability monitoring
In this work we propose an online reliability tracking framework that utilizes a hybrid network of on-chip temperature and delay sensors together with a circuit reliability macrom...
Bin Zhang
ICDE
2009
IEEE
148views Database» more  ICDE 2009»
16 years 3 months ago
Online Interval Skyline Queries on Time Series
In many applications, we need to analyze a large number of time series. Segments of time series demonstrating dominating advantages over others are often of particular interest. In...
Bin Jiang, Jian Pei
IJCAI
2007
15 years 3 months ago
Detect and Track Latent Factors with Online Nonnegative Matrix Factorization
Detecting and tracking latent factors from temporal data is an important task. Most existing algorithms for latent topic detection such as Nonnegative Matrix Factorization (NMF) h...
Bin Cao, Dou Shen, Jian-Tao Sun, Xuanhui Wang, Qia...