Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

JCSS
2000

favoriteEmaildiscussreport

86views more JCSS 2000»

Improved Algorithms via Approximations of Probability Distributions

13 years 4 months ago

Improved Algorithms via Approximations of Probability Distributions

Download www.cs.umd.edu

Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan

Real-time Traffic

JCSS 2000 |

claim paper

Related Content

» Improved Approximation of Linear Threshold Functions

» Tuning Up the Performance of ConstantTime Distributed Scheduling Algorithms via Majorizati...

» Improving humanoid locomotive performance with learnt approximated dynamics via Gaussian p...

» An ACO Algorithm for the Most Probable Explanation Problem

» Performance Evaluation of Loss Networks via Factor Graphs and the SumProduct Algorithm

» Improved linear softinput softoutput detection via soft feedback successive interference c...

» Converting Output Scores from Outlier Detection Algorithms into Probability Estimates

» Using Prior Knowledge to Improve Distributed Hill Climbing

» Truthful and NearOptimal Mechanism Design via Linear Programming

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	JCSS
Authors	Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan

Comments (0)