Sciweavers

257 search results - page 47 / 52
» A (Somewhat) New Solution to the Variable Binding Problem
Sort
View
STACS
2004
Springer
14 years 14 days ago
An Algorithmic View on OVSF Code Assignment
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
Thomas Erlebach, Riko Jacob, Matús Mihal&aa...
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 7 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
ICB
2007
Springer
208views Biometrics» more  ICB 2007»
14 years 1 months ago
Face Matching Between Near Infrared and Visible Light Images
Abstract. In many applications, such as E-Passport and driver’s license, the enrollment of face templates is done using visible light (VIS) face images. Such images are normally ...
Dong Yi, Rong Liu, Rufeng Chu, Zhen Lei, Stan Z. L...
SIGMETRICS
2008
ACM
101views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
How to parameterize models with bursty workloads
Although recent advances in theory indicate that burstiness in the service time process can be handled effectively by queueing models (e.g., MAP queueing networks [2]), there is a...
Giuliano Casale, Ningfang Mi, Ludmila Cherkasova, ...
JMLR
2010
179views more  JMLR 2010»
13 years 1 months ago
PAC-Bayesian Analysis of Co-clustering and Beyond
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
Yevgeny Seldin, Naftali Tishby