465 search results - page 57 / 93 » Optimizing Local Probability Models for Statistical Parsing |
117
click to vote
ISNN
2005
Springer
15 years 7 months ago
2005
Springer
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
111
click to vote
CVPR
1999
IEEE
16 years 4 months ago
1999
IEEE
We consider a problem central in aerial visual surveillance applications { detection and tracking of small, independently moving objects in long and noisy video sequences. We dire...
SIGMETRICS
2002
ACM
15 years 1 months ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
108
click to vote
TON
1998
15 years 1 months ago
1998
— This paper investigates in detail the blocking and nonblocking behavior of multirate Clos switching networks at the connection/virtual connection level. The results are applica...
111
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
We present a probabilistic formulation of UCS (a sUpervised Classifier System). UCS is shown to be a special case of mixture of experts where the experts are learned independentl...