461 search results - page 19 / 93 » Higher Kurtz randomness |
ICML
2004
IEEE
16 years 2 months ago
2004
IEEE
Many NLP tasks rely on accurately estimating word dependency probabilities P(w1|w2), where the words w1 and w2 have a particular relationship (such as verb-object). Because of the...
112
click to vote
IEEEPACT
2007
IEEE
15 years 8 months ago
2007
IEEE
Distinguishing transient blocks from frequently used blocks enables servicing references to transient blocks from a small fully-associative auxiliary cache structure. By inserting...
119
click to vote
DAGM
2004
Springer
15 years 7 months ago
2004
Springer
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
103
click to vote
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
We present a novel language identification technique using our recently developed deep-structured conditional random fields (CRFs). The deep-structured CRF is a multi-layer CRF mo...
120
click to vote
CAL
2008
15 years 2 months ago
2008
Abstract-- This letter presents a new oblivious routing algorithm for 3D mesh networks called Randomized PartiallyMinimal (RPM) routing that provably achieves optimal worstcase thr...