Sciweavers

389 search results - page 54 / 78
» Classifications of bifix codes
Sort
View
DM
2006
86views more  DM 2006»
13 years 8 months ago
Decomposing oriented graphs into transitive tournaments
For an oriented graph G with n vertices, let f(G) denote the minimum number of transitive subtournaments that decompose G. We prove several results on f(G). In particular, if G is...
Raphael Yuster
IEPOL
2002
64views more  IEPOL 2002»
13 years 8 months ago
Is there 'Hope' for price cap regulation?
This article examines the problem of regulatory opportunism or strategic behavior by the regulator that undermines the performance of price cap regulation (PCR) without technicall...
Dennis L. Weisman
JMLR
2010
163views more  JMLR 2010»
13 years 3 months ago
Dense Message Passing for Sparse Principal Component Analysis
We describe a novel inference algorithm for sparse Bayesian PCA with a zero-norm prior on the model parameters. Bayesian inference is very challenging in probabilistic models of t...
Kevin Sharp, Magnus Rattray
CHI
2006
ACM
14 years 9 months ago
PaperSpace: a system for managing digital and paper documents
Here we present PaperSpace a computer vision based document management system that allows users to combine paper and digital documents. Using PaperSpace users can locate paper cop...
Jeff Smith, Jeremy Long, Tanya Lung, Mohd M. Anwar...
ICASSP
2008
IEEE
14 years 3 months ago
ITU-T G.EV-VBR baseline codec
We present the G.EV-VBR winning candidate codec recently selected by Question 9 of Study Group 16 (Q9/16) of ITU-T as a baseline for the development of a scalable solution for wid...
Milan Jelinek, Tommy Vaillancourt, A. Erdem Ertan,...