Results 1  10
of
121,755
Similarity estimation techniques from rounding algorithms
 In Proc. of 34th STOC
, 2002
"... A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, Prh∈F[h(x) = h(y)] = sim(x,y), where sim(x,y) ∈ [0, 1] is some similarity function defined on the collection of objects. Such a scheme leads ..."
Abstract

Cited by 449 (6 self)
 Add to MetaCart
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, Prh∈F[h(x) = h(y)] = sim(x,y), where sim(x,y) ∈ [0, 1] is some similarity function defined on the collection of objects. Such a scheme leads
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
, 2000
"... In this paper we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: ffl we show how to maintain (using only O(log n=ffl 2 ) words of storage) a sketch C(p) of a point p 2 l n 1 under dynamic updates of its coo ..."
Abstract

Cited by 324 (13 self)
 Add to MetaCart
coordinates, such that given sketches C(p) and C(q) one can estimate jp \Gamma qj 1 up to a factor of (1 + ffl) with large probability. This solves the main open problem of [10]. ffl we obtain another sketch function C 0 which maps l n 1 into a normed space l m 1 (as opposed to C), such that m = m
Abstractions for Software Architecture and Tools to Support Them
 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 1995
"... Architectures for software use rich abstractions and idioms to describe system components, the nature of interactions among the components, and the patterns that guide the composition of components into systems. These abstractions are higherlevel than the elements usually supported by programming ..."
Abstract

Cited by 364 (6 self)
 Add to MetaCart
by programming languages and tools. They capture packaging and interaction issues as well as computational functionality. Wellestablished (if informal) patterns guide architectural design of systems. We sketch a model for defining architectures and present an implementation of the basic level of that model
Approximating the permanent
 SIAM J. Computing
, 1989
"... Abstract. A randomised approximation scheme for the permanent of a 01 matrix is presented. The task of estimating a permanent is reduced to that of almost uniformly generating perfect matchings in a graph; the latter is accomplished by simulating a Markov chain whose states are the matchings in the ..."
Abstract

Cited by 345 (26 self)
 Add to MetaCart
matrices in some reasonable probabilistic model for 01 matrices of given density. For the approach sketched above to be computationally efficient, the Markov chain must be rapidly mixing: informally, it must converge in a short time to its stationary distribution. A major portion of the paper is devoted
Combinatorial sketching for finite programs
 IN 12TH INTERNATIONAL CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS (ASPLOS 2006
, 2006
"... Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The synthesizer then completes the sketch to behave like the specification. The correctness of the synthesized implementation is g ..."
Abstract

Cited by 102 (18 self)
 Add to MetaCart
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The synthesizer then completes the sketch to behave like the specification. The correctness of the synthesized implementation
Sketching Stencils
"... Performance of stencil computations can be significantly improved through smart implementations that improve memory locality, computation reuse, or parallelize the computation. Unfortunately, efficient implementations are hard to obtain because they often involve nontraditional transformations, whi ..."
Abstract

Cited by 41 (6 self)
 Add to MetaCart
approach where the programmer develops a partial implementation— a sketch—and a separate specification of the desired functionality given by a reference (unoptimized) stencil. The synthesizer then completes the sketch to behave like the specification, filling in code fragments that are difficult to develop
Sketches for Design and Design of Sketches
 In U. Lindemann (Ed.), Human Behavior in Design: Individuals, Teams, Tools
, 2003
"... Design consists of generating ideas and adapting them to users. Cognitive research can give insights into each of these processes. Here, we describe two projects involving sketches. Sketches are cognitive tools; they have many uses, among them: to promote inferences and new ideas; to organize and co ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Design consists of generating ideas and adapting them to users. Cognitive research can give insights into each of these processes. Here, we describe two projects involving sketches. Sketches are cognitive tools; they have many uses, among them: to promote inferences and new ideas; to organize
Sketching Valuation Functions
, 2011
"... Motivated by the problem of querying and communicating bidders ’ valuations in combinatorial auctions, we study how well different classes of set functions can be sketched. More formally, let f be a function mapping subsets of some ground set [n] to the nonnegative real numbers. We say that f ′ is ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
Motivated by the problem of querying and communicating bidders ’ valuations in combinatorial auctions, we study how well different classes of set functions can be sketched. More formally, let f be a function mapping subsets of some ground set [n] to the nonnegative real numbers. We say that f
The geometry of optimal transportation
 Acta Math
, 1996
"... A classical problem of transporting mass due to Monge and Kantorovich is solved. Given measures µ and ν on R d, we find the measurepreserving map y(x) between them with minimal cost — where cost is measured against h(x − y) withhstrictly convex, or a strictly concave function of x − y. This map i ..."
Abstract

Cited by 240 (33 self)
 Add to MetaCart
A classical problem of transporting mass due to Monge and Kantorovich is solved. Given measures µ and ν on R d, we find the measurepreserving map y(x) between them with minimal cost — where cost is measured against h(x − y) withhstrictly convex, or a strictly concave function of x − y. This map
Biographical Sketch
, 1999
"... Finding appropriate transfer functions for direct volume rendering is a dicult problem because of the large amount of user experimentation typically involved. Ideally, the dataset being rendered should itself be able to suggest a transfer function which makes the important structures visible. We de ..."
Abstract
 Add to MetaCart
Finding appropriate transfer functions for direct volume rendering is a dicult problem because of the large amount of user experimentation typically involved. Ideally, the dataset being rendered should itself be able to suggest a transfer function which makes the important structures visible. We
Results 1  10
of
121,755