Results 1  10
of
2,423,787
Ktheory for operator algebras
 Mathematical Sciences Research Institute Publications
, 1998
"... p. XII line5: since p. 12: I blew this simple formula: should be α = −〈ξ, η〉/〈η, η〉. p. 2 I.1.1.4: The RieszFischer Theorem is often stated this way today, but neither Riesz nor Fischer (who worked independently) phrased it in terms of completeness of the orthogonal system {e int}. If [a, b] is a ..."
Abstract

Cited by 558 (0 self)
 Add to MetaCart
Neumann used the same name for Hilbert spaces in the modern sense (complete inner product spaces), which he defined in 1928. p. 3 line6: At the end of the line, 2ɛ should be 4ɛ. p. 3 I.1.2.3: The statement that a dense subspace of a Hilbert space H contains an orthonormal basis for H can be false if H
Pin: building customized program analysis tools with dynamic instrumentation
 IN PLDI ’05: PROCEEDINGS OF THE 2005 ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION
, 2005
"... Robust and powerful software instrumentation tools are essential for program analysis tasks such as profiling, performance evaluation, and bug detection. To meet this need, we have developed a new instrumentation system called Pin. Our goals are to provide easytouse, portable, transparent, and eff ..."
Abstract

Cited by 988 (35 self)
 Add to MetaCart
delivers significantly better instrumentation performance than similar tools. For example, Pin is 3.3x faster than Valgrind and 2x faster than DynamoRIO for basicblock counting. To illustrate Pin’s versatility, we describe two Pintools in daily use to analyze production software. Pin is publicly available
Matlab user’s guide
, 2005
"... This product or document is protected by copyright and distributed under licenses restricting its use, copying, distribution, and decompilation. No part of this product or document may be reproduced in any form by any means without prior written authorization of Sun and its licensors, if any. Portio ..."
Abstract

Cited by 535 (0 self)
 Add to MetaCart
. Portions of this product may be derived from the UNIX ® system, licensed from Novell, Inc., and from the Berkeley 4.3 BSD system, licensed from the University of California. UNIX is a registered trademark in the United States and other countries and is exclusively licensed by X/Open Company Ltd. Third
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 674 (15 self)
 Add to MetaCart
the convergence the more exact the approximation. • If the hidden nodes are binary, then thresholding the loopy beliefs is guaranteed to give the most probable assignment, even though the numerical value of the beliefs may be incorrect. This result only holds for nodes in the loop. In the maxproduct (or "
Ricci Flow with Surgery on ThreeManifolds
"... This is a technical paper, which is a continuation of [I]. Here we verify most of the assertions, made in [I, §13]; the exceptions are (1) the statement that a 3manifold which collapses with local lower bound for sectional curvature is a graph manifold this is deferred to a separate paper, as the ..."
Abstract

Cited by 446 (2 self)
 Add to MetaCart
of all points (x ′ , t ′ ) with x ′ ∈ B(x, t, r) and t ′ ∈ [t, t + △t] or t ′ ∈ [t + △t, t], depending on the sign of △t. A ball B(x, t, ǫ −1 r) is called an ǫneck, if, after scaling the metric with factor r −2, it is ǫclose to the standard neck S 2 × I, with the product metric, where S 2 has
Parallel Prefix Computation
 JOURNAL OF THE ACM
, 1980
"... The prefix problem is to compute all the products x t o x2.... o xk for i ~ k. ~ n, where o is an associative operation A recursive construction IS used to obtain a product circuit for solving the prefix problem which has depth exactly [log:n] and size bounded by 4n An application yields fast, smal ..."
Abstract

Cited by 337 (1 self)
 Add to MetaCart
The prefix problem is to compute all the products x t o x2.... o xk for i ~ k. ~ n, where o is an associative operation A recursive construction IS used to obtain a product circuit for solving the prefix problem which has depth exactly [log:n] and size bounded by 4n An application yields fast
Global simulation of tropospheric O3NOxhydrocarbon chemistry  1. Model formulation
, 1998
"... We describe a global threedimensional model for tropospheric O 3NO xhydrocarbon chemistry with synopticscale resolution. A suite of 15 chemical tracers, including O 3, NO x, PAN, HNO 3, CO, H 2 O 2, and various hydrocarbons, is simulated in the model. For computational expediency, chemical pro ..."
Abstract

Cited by 267 (89 self)
 Add to MetaCart
We describe a global threedimensional model for tropospheric O 3NO xhydrocarbon chemistry with synopticscale resolution. A suite of 15 chemical tracers, including O 3, NO x, PAN, HNO 3, CO, H 2 O 2, and various hydrocarbons, is simulated in the model. For computational expediency, chemical
Orbihedra Of Nonpositive Curvature
 Progress in Mathematics
, 1995
"... . A 2dimensional orbihedron of nonpositive curvature is a pair (X; \Gamma), where X is a 2dimensional simplicial complex with a piecewise smooth metric such that X has nonpositive curvature in the sense of Alexandrov and Busemann and \Gamma is a group of isometries of X which acts properly disc ..."
Abstract

Cited by 250 (10 self)
 Add to MetaCart
. A 2dimensional orbihedron of nonpositive curvature is a pair (X; \Gamma), where X is a 2dimensional simplicial complex with a piecewise smooth metric such that X has nonpositive curvature in the sense of Alexandrov and Busemann and \Gamma is a group of isometries of X which acts properly
Energy Dissipation in General Purpose Microprocessors
 IEEE Journal of Solidstate Circuits
, 1996
"... AbstractIn this paper we investigate possible ways to improve the energy efficiency of a general purpose microprocessor. We show that the energy of a processor depends on its performance, so we chose the energydelay product to compare different processors. To improve the energydelay product we e ..."
Abstract

Cited by 260 (1 self)
 Add to MetaCart
explore methods of reducing energy consumption that do not lead to performance loss (i.e., wasted energy), and explore methods to reduce delay by exploiting instruction level parallelism. We found that careful design reduced the energy dissipation by almost 25%. Pipelining can give approximately a 2x
Extracting paraphrases from a parallel corpus
 In Proc. of the ACL/EACL
, 2001
"... While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semiautomatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple English translations of th ..."
Abstract

Cited by 252 (6 self)
 Add to MetaCart
While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semiautomatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple English translations of the same source text. Our approach yields phrasal and single word lexical paraphrases as well as syntactic paraphrases. 1
Results 1  10
of
2,423,787