Results 1  10
of
106
The ObjectOriented Database System Manifesto
, 1989
"... This paper attempts to define an objectoriented database system. It describes the main features and characteristics that a system must have to qualify as an objectoriented database system. We have separated these characteristics into three groups: ffl Mandatory, the ones the system must satisfy in ..."
Abstract

Cited by 361 (5 self)
 Add to MetaCart
query facility. ffl Optional, the ones that can be added to make the system better, but which are not mandatory. These are multiple inheritance, type checking and inferencing, distribution, design transactions and versions. ffl Open, the points where the designer can make a number of choices
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
EXCHANGE KINETICS IN COBALT(ffl) COMPLEXES
, 2003
"... This Thesis is brought to you for free and open access by TopSCHOLAR®. It has been accepted for inclusion in Masters Theses & Specialist Projects by an authorized administrator of TopSCHOLAR®. For more information, please contact connie.foster@wku.edu. ..."
Abstract
 Add to MetaCart
This Thesis is brought to you for free and open access by TopSCHOLAR®. It has been accepted for inclusion in Masters Theses & Specialist Projects by an authorized administrator of TopSCHOLAR®. For more information, please contact connie.foster@wku.edu.
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
, 1993
"... We prove the following about the Nearest Lattice Vector Problem (in any `p norm), the Nearest Codeword Problem for binary codes, the problem of learning a halfspace in the presence of errors, and some other problems. 1. Approximating the optimum within any constant factor is NPhard. 2. If for some ..."
Abstract

Cited by 170 (7 self)
 Add to MetaCart
. If for some ffl ? 0 there exists a polynomialtime algorithm that approximates the optimum within a factor of 2 log 0:5\Gammaffl n , then every NP language can be decided in quasipolynomial deterministic time, i.e., NP ` DTIME(n poly(log n) ). Moreover, we show that result 2 also holds for the Shortest
c 4 FflCoatings for Aircraft in Cold Weather Conditions c&
"... p\izCw=T he purpose of this presentation YDUCT'ON is to give a short account of our experiences with aircraft coatings and examine some of the damage and problems caused by cold weather and attendant conditions to aircraft surface materials as well as some aircraft parts and equipment directly ..."
Abstract
 Add to MetaCart
directly exposed to open air. Some evaluations of a few coating solutions are also included. First, a few words of the weather conditions in which air operations are
Optimal space lower bounds for all frequency moments
 IN SODA
, 2004
"... We prove that any onepass streaming algorithm which (ffl, ffi)approximates the kth frequency moment Fk, for any real k 6 = 1 and any ffl = \Omega i 1pm j, must use \Omega \Gamma 1ffl2 \Delta bits of space, where m is the size of the universe. This is optimal in terms of ffl, resolves the open qu ..."
Abstract

Cited by 78 (13 self)
 Add to MetaCart
We prove that any onepass streaming algorithm which (ffl, ffi)approximates the kth frequency moment Fk, for any real k 6 = 1 and any ffl = \Omega i 1pm j, must use \Omega \Gamma 1ffl2 \Delta bits of space, where m is the size of the universe. This is optimal in terms of ffl, resolves the open
Open the Box
"... Introduction SAGA or Species Adaptation Genetic Algorithms have been developed over the last 8 years as the modification of standard GAs necessary when one is using them not as function optimisers, but rather as incremental adaptation algorithms. This is inevitably associated with variablelength g ..."
Abstract
 Add to MetaCart
in which varlen GAs can be used: ffl Separate parts of the genotype directly encode separate components of a phenotype, and the latter can have a variable number of components. ffl The genotype only indirectly `encodes' the phenotype via some morphogenetic process, with no direct relationship
The Jacobian and the GinzburgLandau Energy
, 1999
"... We study the GinzburgLandau functional I ffl (u):= 1 ln(1=ffl) Z U 1 2 jruj 2 + 1 4ffl 2 (1 ;juj 2 ) 2 dx # for u 2 H 1 (U # IR 2 ), where U is a bounded, open subset of IR 2 . We show that if a sequence of functions u ffl satisfies sup I ffl (u ffl ) ! 1, then their Jacobia ..."
Abstract

Cited by 59 (6 self)
 Add to MetaCart
We study the GinzburgLandau functional I ffl (u):= 1 ln(1=ffl) Z U 1 2 jruj 2 + 1 4ffl 2 (1 ;juj 2 ) 2 dx # for u 2 H 1 (U # IR 2 ), where U is a bounded, open subset of IR 2 . We show that if a sequence of functions u ffl satisfies sup I ffl (u ffl ) ! 1
New Algorithms for an Ancient Scheduling Problem
, 1992
"... We consider the online version of the original mmachine scheduling problem: given m machines and n positive real jobs, schedule the n jobs on the m machines so as to minimize the makespan, the completion time of the last job. In the online version, as soon as job j arrives, it must be assigned im ..."
Abstract

Cited by 98 (4 self)
 Add to MetaCart
immediately to one of the m machines. We present two main results. The first is a (2  ffl)competitive deterministic algorithm for all m. The competitive ratio of all previous algorithms approaches 2 as m !1. Indeed, the problem of improving the competitive ratio for large m had been open since 1966, when
A Small Approximately MinWise Independent Family of Hash Functions
 Journal of Algorithms
, 1999
"... In this paper we give a construction of a small approximately minwise independent family of hash functions. The number of bits needed to represent each function is O(logn \Delta log 1=ffl). This construction gives a solution to the main open problem of [2]. 1 Introduction A family of functions H ..."
Abstract

Cited by 82 (1 self)
 Add to MetaCart
In this paper we give a construction of a small approximately minwise independent family of hash functions. The number of bits needed to represent each function is O(logn \Delta log 1=ffl). This construction gives a solution to the main open problem of [2]. 1 Introduction A family of functions
Results 1  10
of
106