Keyword

rounding

Description: A numerical operation that replaces a value with a nearby approximate value, commonly used in computation, measurement, and data presentation.

Primary topic: Numerical Methods and Algorithms (22%)

Wikidata ID: wiki/Q663208

OpenAlex ID: keywords/rounding

Tensor-Train Decomposition

2011 · I. V. Oseledets · SIAM Journal on Scientific Computing · 2,645

Towards Sharp Inapproximability For Any 2-CSP

2007 · Per Austrin · Annual Symposium on Foundations of Computer Science · 1,293

Convex Optimization: Algorithms and Complexity

2015 · Sébastien Bubeck · Foundations and Trends® in Machine Learning · 1,241

PDF

MPFR

2007 · Laurent Fousse, Guillaume Hanrot, et al. · ACM Transactions on Mathematical Software · 953

Inference Attacks on Location Tracks

2007 · John Krumm · Springer eBooks · 603

Analysis of the Mean Absolute Error (MAE) and the Root Mean Square Error (RMSE) in Assessing Rounding Model

2018 · Weijie Wang, Yanmin Lu · IOP Conference Series Materials Science and Engineering · 570

PDF

A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem

2001 · Kamal Jain · COMBINATORICA · 540

Computer Arithmetic in Theory and Practice

1981 · Elsevier eBooks · 464

Handbook of Floating-Point Arithmetic

2009 · Jean-Michel Muller, Nicolas Brisebarre, et al. · Birkhäuser Boston eBooks · 460

Fairness and load balancing in wireless LANs using association control

2004 · Yigal Bejerano, Seung-Jae Han, et al. · Proceedings of the 28th Annual International Conference on Mobile Computing And Networking · 333

Rounding Probabilistic Expectations in Surveys

2009 · Charles F. Manski, Francesca Molinari · Journal of Business and Economic Statistics · 307

Dealing with categorical and integer-valued variables in Bayesian Optimization with Gaussian processes

2019 · Eduardo C. Garrido-Merchán, Daniel Hernández-Lobato · Neurocomputing · 292

PDF

SE-Sync: A certifiably correct algorithm for synchronization over the special Euclidean group

2018 · David M Rosen, Luca Carlone, et al. · The International Journal of Robotics Research · 289

PDF

Random walks and anO*(n5) volume algorithm for convex bodies

1997 · Ravi Kannan, L�szl� Lov�sz, et al. · Random Structures and Algorithms · 275

Binary Arithmetic

1960 · George W. Reitwiesner · Advances in computers · 275

Fairness and Load Balancing in Wireless LANs Using Association Control

2007 · Y. Bejerano, Seung-Jae Han, et al. · IEEE/ACM Transactions on Networking · 274

The Santa Claus problem

2006 · Nikhil Bansal, Maxim Sviridenko · ACM Symposium on Theory of Computing (STOC) · 262

Reports of elapsed time: Bounding and rounding processes in estimation.

1990 · Janellen Huttenlocher, Larry V. Hedges, et al. · Journal of Experimental Psychology Learning Memory and Cognition · 249

Handbook of Floating-Point Arithmetic

2018 · Jean-Michel Muller, Nicolas Brunie, et al. · Springer eBooks · 233

A Potential for Bias When Rounding in Multiple Imputation

2003 · Nicholas J Horton, Stuart R Lipsitz, et al. · The American Statistician · 224

Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e

2006 · Uriel Feige, Jan Vondrak · Annual Symposium on Foundations of Computer Science · 219

Truthfulness and Relevance in Telling The Time

2002 · Jean–Baptiste Van Der Henst, Laure Carles, et al. · Mind & Language · 217

Approximation Algorithms for Data Placement Problems

2008 · Ivan Baev, Rajmohan Rajaraman, et al. · SIAM Journal on Computing · 215

Robustness of a multivariate normal approximation for imputation of incomplete binary data

2006 · Coen A. Bernaards, Thomas R. Belin, et al. · Statistics in Medicine · 192

Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics

2001 · Juraj Hromkovič · 181

Works count: 2,232

Citation count: 26,730