2814 search results - page 126 / 563 » Competitive Analysis of Distributed Algorithms |
163
click to vote
EMNLP
2007
15 years 3 months ago
2007
A notable gap in research on statistical dependency parsing is a proper conditional probability distribution over nonprojective dependency trees for a given sentence. We exploit t...
NIPS
2008
15 years 3 months ago
2008
We study the profit-maximization problem of a monopolistic market-maker who sets two-sided prices in an asset market. The sequential decision problem is hard to solve because the ...
118
click to vote
JMLR
2006
15 years 2 months ago
2006
Random forests were introduced as a machine learning tool in Breiman (2001) and have since proven to be very popular and powerful for high-dimensional regression and classificatio...
120
click to vote
JMLR
2010
14 years 9 months ago
2010
Various supervised inference methods can be analyzed as convex duals of the generalized maximum entropy (MaxEnt) framework. Generalized MaxEnt aims to find a distribution that max...
119
Voted
CIDR
2011
14 years 6 months ago
2011
Distributed programming has become a topic of widespread interest, and many programmers now wrestle with tradeoffs between data consistency, availability and latency. Distributed...