Sciweavers

4047 search results - page 154 / 810
» The Discrete Basis Problem
Sort
View
CC
2006
Springer
108views System Software» more  CC 2006»
15 years 6 months ago
A Fresh Look at PRE as a Maximum Flow Problem
We show that classic PRE is also a maximum flow problem, thereby revealing the missing link between classic and speculative PRE, and more importantly, establishing a common high-le...
Jingling Xue, Jens Knoop
TIT
2008
90views more  TIT 2008»
15 years 3 months ago
On Optimal Quantization Rules for Some Problems in Sequential Decentralized Detection
We consider the design of systems for sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the samp...
XuanLong Nguyen, Martin J. Wainwright, Michael I. ...
NECO
2010
97views more  NECO 2010»
15 years 1 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell
ICPR
2006
IEEE
16 years 4 months ago
A Kernel-based Discrimination Framework for Solving Hypothesis Testing Problems with Application to Speaker Verification
Real-word applications often involve a binary hypothesis testing problem with one of the two hypotheses ill-defined and hard to be characterized precisely by a single measure. In ...
Yi-Hsiang Chao, Wei-Ho Tsai, Hsin-Min Wang, Ruei-C...
AAAI
2004
15 years 4 months ago
QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems
Over-constrained problems can have an exponential number of conflicts, which explain the failure, and an exponential number of relaxations, which restore the consistency. A user o...
Ulrich Junker