Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,976
The DaCapo Benchmarks: Java Benchmarking Development and Analysis
"... Since benchmarks drive computer science research and industry product development, which ones we use and how we evaluate them are key questions for the community. Despite complex runtime tradeoffs due to dynamic compilation and garbage collection required for Java programs, many evaluations still us ..."
Abstract
-
Cited by 397 (65 self)
- Add to MetaCart
Capo benchmarks, a set of open source, client-side Java benchmarks. We demonstrate that the complex interactions of (1) architecture, (2) compiler, (3) virtual machine, (4) memory management, and (5) application require more extensive evaluation than C, C++, and Fortran which stress (4) much less, and do
Self-Testing/Correcting with Applications to Numerical Problems
, 1990
"... Suppose someone gives us an extremely fast program P that we can call as a black box to compute a function f . Should we trust that P works correctly? A self-testing/correcting pair allows us to: (1) estimate the probability that P (x) 6= f(x) when x is randomly chosen; (2) on any input x, compute ..."
Abstract
-
Cited by 361 (27 self)
- Add to MetaCart
f(x) correctly as long as P is not too faulty on average. Furthermore, both (1) and (2) take time only slightly more than Computer Science Division, U.C. Berkeley, Berkeley, California 94720, Supported by NSF Grant No. CCR 88-13632. y International Computer Science Institute, Berkeley
A Safe Approximate Algorithm for Interprocedural Pointer Aliasing
, 1992
"... Aliasing occurs at some program point during execution when two or more names exist for the same location. In a language which allows pointers, the problem of determining the set of pairs of names at a program point which may refer to the same location during program execution is NP-hard. We present ..."
Abstract
-
Cited by 351 (31 self)
- Add to MetaCart
Department of Computer Science, Rutgers University, New Brunswick, NJ 08903 Contents 1 Introduction 3 2 Problem Representation 6 2.1 Interprocedural Control Flow Graph : : : : : : : : : : : : : : : : : : : : : : : : : : : 6 2.2 Types
Authors:
, 1997
"... 1 Dedicated to Ludwig Elsner on the occasion of his sixtieth birthday We describe canonical forms for elements of a classical Lie group of matrices under similarity transformations in the group. Matrices in the associated Lie algebra and Jordan algebra of matrices inherit related forms under these s ..."
Abstract
- Add to MetaCart
1 Dedicated to Ludwig Elsner on the occasion of his sixtieth birthday We describe canonical forms for elements of a classical Lie group of matrices under similarity transformations in the group. Matrices in the associated Lie algebra and Jordan algebra of matrices inherit related forms under
Quantitative universality for a class of nonlinear Transformations
- J. Statistical Physics
, 1978
"... A large class of recursion relations xn+l = Af(xn) exhibiting infinite bifurcation is shown to possess a rich quantitative structure essentially independent of the recursion function. The functions considered all have a unique differentiable maximum 2. With f(2)- f(x) ~ Ix- 21 " (for Ix- 21 su ..."
Abstract
-
Cited by 263 (0 self)
- Add to MetaCart
sufficiently small), z> 1, the universal details depend only upon z. In particular, the local structure of high-order stability sets is shown to approach universality, rescaling in successive bifurcations, asymptotically by the ratio c ~ (a = 2.5029078750957... for z = 2). This structure is determined by a
2011 8th International Symposium on Wireless Communication Systems, Aachen New Achievable Rates for the Gaussian Broadcast Channel with Feedback
"... Abstract—A coding scheme for the two-receivers Gaussian broadcast channel (BC) with feedback is proposed. For some asymmetric settings it achieves new rate pairs. Moreover, it achieves prelog 2 when the noises at the two receivers are fully positively correlated and of unequal variances, thus allowi ..."
Abstract
- Add to MetaCart
, memoryless two-user Gaussian broadcast channel (BC) with perfect feedback. Achievable regions for this setup were proposed by Ozarow & Leung [9], Elia [4], Wu et al. [11], and Ardestanizadeh et al. [1]. The
Results 1 - 10
of
1,976
