5785 search results - page 1067 / 1157 » Approximability of Probability Distributions |
142
click to vote
SIGCOMM
2012
ACM
13 years 4 months ago
2012
ACM
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
117
click to vote
ACL
2012
13 years 4 months ago
2012
This paper describes a novel approach towards the empirical approximation of discourse relations between different utterances in texts. Following the idea that every pair of event...
112
click to vote
STOC
2007
ACM
16 years 1 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
155
click to vote
CVPR
2003
IEEE
16 years 3 months ago
2003
IEEE
Monitoring activities using video data is an important surveillance problem. A special scenario is to learn the pattern of normal activities and detect abnormal events from a very...
137
click to vote
CVPR
2004
IEEE
16 years 3 months ago
2004
IEEE
Most tracking algorithms are based on the maximum a posteriori (MAP) solution of a probabilistic framework called Hidden Markov Model, where the distribution of the object state a...