2403 search results - page 178 / 481 » Optimal Randomized RANSAC |
122
Voted
EUROPAR
2009
Springer
15 years 7 months ago
2009
Springer
We consider a multi-processor system-on-chip destined for streaming applications. An application is composed of one input and one output queue and in-between, several levels of ide...
135
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
114
Voted
IJCAI
2001
15 years 4 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
159
Voted
UAI
2003
15 years 4 months ago
2003
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...
269
Voted
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...