Sciweavers

567 search results - page 31 / 114
» Exact train pathing
Sort
View
TIT
2008
83views more  TIT 2008»
14 years 11 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
ICFEM
2009
Springer
15 years 6 months ago
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
Samik Basu, Arka P. Ghosh, Ru He
ESANN
2008
15 years 1 months ago
Phase transitions in Vector Quantization
Abstract. We study Winner-Takes-All and rank based Vector Quantization along the lines of the statistical physics of off-line learning. Typical behavior of the system is obtained w...
Aree Witoelar, Anarta Ghosh, Michael Biehl
SDM
2007
SIAM
81views Data Mining» more  SDM 2007»
15 years 1 months ago
A PAC Bound for Approximate Support Vector Machines
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
Dongwei Cao, Daniel Boley
CVPR
2011
IEEE
14 years 8 months ago
Truncated Message Passing
Training of conditional random fields often takes the form of a double-loop procedure with message-passing inference in the inner loop. This can be very expensive, as the need to...
Justin Domke