Results 1  10
of
6,714
Studies of transformation of Escherichia coli with plasmids
 J. Mol. Biol
, 1983
"... Factors that affect he probability of genetic transformation f Escherichia coli by plasmids have been evaluated. A set of conditions is described under which about one in every 400 plasmid molecules produces a transformed cell. These conditions include cell growth in medium containing elevated level ..."
Abstract

Cited by 1632 (1 self)
 Add to MetaCart
levels of Mg 2+. and incubation of the cells at 0 ~ in a solution of Mn 2+, ("a 2+, Rb + or K +, dimethyl sulfoxide, dithiothreitol, and hexamine cobalt (III). Transibrmation efficiency declines linearly with increasing plasmid size. Relaxed and supercoiled plasmids transfol'm with similar
INFORMATION PRODUCTION AND CAPITAL ALLOCATION: DECENTRALIZED VS. HIERARCHICAL FIRMS
, 2000
"... This paper assesses different organizational forms in terms of their ability to generate information about investment projects and allocate capital to these projects efficiently. A decentralized approach–with small, singlemanager firms–is most likely to be attractive when information about individu ..."
Abstract

Cited by 456 (6 self)
 Add to MetaCart
individual projects is “soft ” and cannot be credibly transmitted. Moreover, holding fixed firm size, soft information also favors flatter organizations with fewer layers of management. In contrast, large hierarchical firms with multiple layers of management are at a comparative advantage when information
Division by Invariant Integers Using Multiplication
 In Proceedings of the SIGPLAN '94 Conference on Programming Language Design and Implementation
, 1994
"... Integer division remains expensive on today's processors as the cost of integer multiplication declines. We present code sequences for division by arbitrary nonzero integer constants and runtime invariants using integer multiplication. The algorithms assume a two's complement architectur ..."
Abstract

Cited by 49 (1 self)
 Add to MetaCart
Integer division remains expensive on today's processors as the cost of integer multiplication declines. We present code sequences for division by arbitrary nonzero integer constants and runtime invariants using integer multiplication. The algorithms assume a two's complement
SelfTesting/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 selftesting/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
of numerical problems, including integer multiplication, modular multiplication, matrix multiplicatio...
Support vector machines for multipleinstance learning
 Advances in Neural Information Processing Systems 15
, 2003
"... This paper presents two new formulations of multipleinstance learning as a maximum margin problem. The proposed extensions of the Support Vector Machine (SVM) learning approach lead to mixed integer quadratic programs that can be solved heuristically. Our generalization of SVMs makes a stateofthe ..."
Abstract

Cited by 314 (2 self)
 Add to MetaCart
This paper presents two new formulations of multipleinstance learning as a maximum margin problem. The proposed extensions of the Support Vector Machine (SVM) learning approach lead to mixed integer quadratic programs that can be solved heuristically. Our generalization of SVMs makes a state
The Rise and Decline of the American Ghetto
 Journal of Political Economy
, 1999
"... you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the publisher regarding any further use of this work. Publisher contact inform ..."
Abstract

Cited by 252 (17 self)
 Add to MetaCart
you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the publisher regarding any further use of this work. Publisher contact
Maintaining Stream Statistics over Sliding Windows (Extended Abstract)
, 2002
"... We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding window model. We consider the following basic problem: Given a stream of bits, maintain a count of the number of 1's i ..."
Abstract

Cited by 269 (9 self)
 Add to MetaCart
extend our scheme to maintain the sum of the last N positive integers. We provide matching upper and lower bounds for this more general problem as well. We apply our techniques to obtain efficient algorithms for the Lp norms (for p 2 [1; 2]) of vectors under the sliding window model. Using the algorithm
Faster Integer Multiplication
 STOC'07
, 2007
"... For more than 35 years, the fastest known method for integer multiplication has been the SchönhageStrassen algorithm running in time O(n log n log log n). Under certain restrictive conditions there is a corresponding Ω(n log n) lower bound. The prevailing conjecture has always been that the complex ..."
Abstract

Cited by 89 (0 self)
 Add to MetaCart
For more than 35 years, the fastest known method for integer multiplication has been the SchönhageStrassen algorithm running in time O(n log n log log n). Under certain restrictive conditions there is a corresponding Ω(n log n) lower bound. The prevailing conjecture has always been
Fully Homomorphic Encryption over the Integers
, 2009
"... We construct a simple fully homomorphic encryption scheme, using only elementary modular arithmetic. We use Gentry’s technique to construct fully homomorphic scheme from a “bootstrappable” somewhat homomorphic scheme. However, instead of using ideal lattices over a polynomial ring, our bootstrappabl ..."
Abstract

Cited by 141 (10 self)
 Add to MetaCart
bootstrappable encryption scheme merely uses addition and multiplication over the integers. The main appeal of our scheme is the conceptual simplicity. We reduce the security of our scheme to finding an approximate integer gcd – i.e., given a list of integers that are nearmultiples of a hidden integer, output
Recent approaches to global optimization problems through Particle Swarm Optimization
 Natural Computing
, 2002
"... This paper presents an overview of our most recent results concerning the Particle Swarm Optimization (PSO) method. Techniques for the alleviation of local minima, and for detecting multiple minimizers are described. Moreover, results on the ability of the PSO in tackling Multiobjective, Minimax, In ..."
Abstract

Cited by 211 (34 self)
 Add to MetaCart
This paper presents an overview of our most recent results concerning the Particle Swarm Optimization (PSO) method. Techniques for the alleviation of local minima, and for detecting multiple minimizers are described. Moreover, results on the ability of the PSO in tackling Multiobjective, Minimax
Results 1  10
of
6,714