Sciweavers

438 search results - page 26 / 88
» On Perfect Switching Classes
Sort
View
ICASSP
2011
IEEE
13 years 11 days ago
Learning and inference algorithms for partially observed structured switching vector autoregressive models
We present learning and inference algorithms for a versatile class of partially observed vector autoregressive (VAR) models for multivariate time-series data. VAR models can captu...
Balakrishnan Varadarajan, Sanjeev Khudanpur
INFOCOM
1994
IEEE
14 years 23 days ago
Scheduling Nonuniform Traffic in a Packet Switching System with Small Propagation Delay
A new model of nonuniform traffic is introduced for a single-hop packet-switching system. This traffic model allows arbitrary traffic streams subject only to a constraint on the nu...
Timothy Weller, Bruce Hajek
IANDC
2008
74views more  IANDC 2008»
13 years 8 months ago
Baire categories on small complexity classes and meager-comeager laws
We introduce two resource-bounded Baire category notions on small complexity classes such as P, QUASIPOLY, SUBEXP and PSPACE and on probabilistic classes such as BPP, which differ...
Philippe Moser
SIAMJO
2008
175views more  SIAMJO 2008»
13 years 8 months ago
On Bin Packing with Conflicts
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Leah Epstein, Asaf Levin
IPL
2000
111views more  IPL 2000»
13 years 8 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