Results 1  10
of
389
Widearea cooperative storage with CFS
, 2001
"... The Cooperative File System (CFS) is a new peertopeer readonly storage system that provides provable guarantees for the efficiency, robustness, and loadbalance of file storage and retrieval. CFS does this with a completely decentralized architecture that can scale to large systems. CFS servers pr ..."
Abstract

Cited by 999 (53 self)
 Add to MetaCart
provide a distributed hash table (DHash) for block storage. CFS clients interpret DHash blocks as a file system. DHash distributes and caches blocks at a fine granularity to achieve load balance, uses replication for robustness, and decreases latency with server selection. DHash finds blocks using
Dirty Pages of Logarithm Tables, Lifetime Of The Universe, and (Subjective) Probabilities on Finite and Infinite Intervals
 Reliable Computing
, 2002
"... In many engineering problems, we want a physical characteristic y to lie within given range Y; e.g., for all possible values of the load x from 0 to x0 , the resulting stress y of a mechanical structure should not exceed a given value y0 . If no such design is possible, then, from the purely mat ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In many engineering problems, we want a physical characteristic y to lie within given range Y; e.g., for all possible values of the load x from 0 to x0 , the resulting stress y of a mechanical structure should not exceed a given value y0 . If no such design is possible, then, from the purely mathematical viewpoint, all possible designs are equally bad. Intuitively, however, a design for which y y0 for all values x 2 [0; 0:99 \Delta x0 ] is "more probable" to work well than a design for which y y0 only for the values x 2 [0; 0:5 \Delta x0 ]. In this paper, we describe an interval computationsrelated formalization for this subjective notion of probability. We show that this description is in good accordance with the empirical distribution of numerical data and with the problems related to estimating the lifetime of the Universe.
CollusionSecure Fingerprinting for Digital Data
 IEEE Transactions on Information Theory
, 1996
"... This paper discusses methods for assigning codewords for the purpose of fingerprinting digital data (e.g., software, documents, and images). Fingerprinting consists of uniquely marking and registering each copy of the data. This marking allows a distributor to detect any unauthorized copy and trac ..."
Abstract

Cited by 353 (1 self)
 Add to MetaCart
cryptographic technique. For instance, several hundred years ago logarithm tables were protec...
Tissot’s table of logarithms
, 2011
"... We know very little on S.L. Tissot. The 3page introduction to his table of “logarithms” states that he was agent voyer (road surveyor) in Mâcon (France). This introduction is dated 12 November 1884. We also know that Tissot published a table of abscissas and ordinates in 1874, apparently in order ..."
Abstract
 Add to MetaCart
We know very little on S.L. Tissot. The 3page introduction to his table of “logarithms” states that he was agent voyer (road surveyor) in Mâcon (France). This introduction is dated 12 November 1884. We also know that Tissot published a table of abscissas and ordinates in 1874, apparently in order
table of logarithms of numbers
, 2011
"... a reputed starosta (elder official). After the death of his father in 1617, Smogulecki was sent to the University of Freiburg in Germany. At the age of 15 or 16, he published a Latin tract with the title Sol illustratus ac propugnatus [22]. Smogulecki’s tract was cited by the mathematician and astro ..."
Abstract
 Add to MetaCart
a reputed starosta (elder official). After the death of his father in 1617, Smogulecki was sent to the University of Freiburg in Germany. At the age of 15 or 16, he published a Latin tract with the title Sol illustratus ac propugnatus [22]. Smogulecki’s tract was cited by the mathematician and astronomer Christoph Scheiner in his book Rosa Ursina (1626–1630). Scheiner was one of the first to observe sunspots in 1611. In 1628, Smogulecki was in Rome studying law and philosophy at the Jesuit University. He also briefly studied in Padua in 1629. After having completed his philosophical studies, he returned to Poland, probably in 1629. Smogulecki then became involved in politics, in the footsteps of his father. In 1634, he was in charge of paying the army. For an unknown reason, Smogulecki entered the convent of Cracow in 1636. He spent two years in this convent and the following two years at the College of Saint Peter in Cracow. In 1640, he returned to Rome in order to study at the Collegio Romano and was probably ordinated in 1641 or 1642. In 1641, he requested to be sent on a mission. In 1643, Smogulecki left Rome for Portugal and in 1644 he embarked on a boat for
Logarithmic minimal models
"... Working in the dense loop representation, we use the planar TemperleyLieb algebra to build integrable lattice models called logarithmic minimal models LM(p,p ′). Specifically, we construct YangBaxter integrable TemperleyLieb models on the strip acting on link states and consider their associated ..."
Abstract

Cited by 88 (25 self)
 Add to MetaCart
Working in the dense loop representation, we use the planar TemperleyLieb algebra to build integrable lattice models called logarithmic minimal models LM(p,p ′). Specifically, we construct YangBaxter integrable TemperleyLieb models on the strip acting on link states and consider their associated
Classification using Intersection Kernel Support Vector Machines is Efficient ∗
"... Straightforward classification using kernelized SVMs requires evaluating the kernel for a test vector and each of the support vectors. For a class of kernels we show that one can do this much more efficiently. In particular we show that one can build histogram intersection kernel SVMs (IKSVMs) with ..."
Abstract

Cited by 256 (10 self)
 Add to MetaCart
) with runtime complexity of the classifier logarithmic in the number of support vectors as opposed to linear for the standard approach. We further show that by precomputing auxiliary tables we can construct an approximate classifier with constant runtime and space requirements, independent of the number
Henri Andoyer’s table of logarithms
, 2011
"... This book is a complete reconstruction of Henri Andoyer’s tables for the computation of logarithms of numbers, published in 1922 [5]. They were a sequel to Andoyer’s tables of logarithms of trigonometric functions (1911) [1] and of natural values of trigonometric functions (three volumes, 1915–1918) ..."
Abstract
 Add to MetaCart
This book is a complete reconstruction of Henri Andoyer’s tables for the computation of logarithms of numbers, published in 1922 [5]. They were a sequel to Andoyer’s tables of logarithms of trigonometric functions (1911) [1] and of natural values of trigonometric functions (three volumes, 1915
Logarithmic vector fields and multiplication table
, 2006
"... This is a review article on the GaussManin system associated to the complete intersection singularities of projection. We show how the logarithmic vector fields appear as coefficients to the GaussManin system (Theorem 2.7). We examine further how the multiplication table on the Jacobian quotient m ..."
Abstract
 Add to MetaCart
This is a review article on the GaussManin system associated to the complete intersection singularities of projection. We show how the logarithmic vector fields appear as coefficients to the GaussManin system (Theorem 2.7). We examine further how the multiplication table on the Jacobian quotient
Unified Tables for Exponential and Logarithm Families
"... Accurate table methods allow for very accurate and efficient evaluation of elementary functions. We present new singletable approaches to logarithm and exponential evaluation, by which we mean that a single table of values works for both log(x) and log(1 + x), and a single table for ex and ex − 1. ..."
Abstract
 Add to MetaCart
Accurate table methods allow for very accurate and efficient evaluation of elementary functions. We present new singletable approaches to logarithm and exponential evaluation, by which we mean that a single table of values works for both log(x) and log(1 + x), and a single table for ex and ex − 1
Results 1  10
of
389