Results 1  10
of
14
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
Towards a Theory of Volatility Trading
 Reprinted in Option Pricing, Interest Rates, and Risk Management, Musiella, Jouini, Cvitanic
, 1998
"... Introduction ffl Three methods have evolved for trading vol: 1. static positions in options eg. straddles 2. deltahedged option positions 3. volatility swaps ffl The purpose of this talk is to explore the advantages and disadvantages of each approach. ffl I'll show how the first two methods ..."
Abstract

Cited by 122 (15 self)
 Add to MetaCart
Introduction ffl Three methods have evolved for trading vol: 1. static positions in options eg. straddles 2. deltahedged option positions 3. volatility swaps ffl The purpose of this talk is to explore the advantages and disadvantages of each approach. ffl I'll show how the first two
MOLecular Structure GENeration with MOLGEN, new features and future developments
 Fresenius J. Anal. Chem
, 1997
"... MOLGEN is a computer program system which is designed for generating molecular graphs fast, redundancy free and exhaustively. In the present paper we describe its basic features, new features of the current release MOLGEN 3.5, and future developments which provide considerable improvements and ex ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
. The input consists of ffl the empirical formula, together with ffl an optional list of macroatoms, which means prescribed substructures that must not overlap, ffl an optional goodlist, that consists of prescribed substructures which may overlap, ffl an optional badlist, containing forbidden substructures
EUCLID CALMA Radio Link Frequency Assignment Project Technical Annexe T 2.1:B  The GAmeter User Manual
"... tions in this window will be described in turn. Figure 1: The window in XGAmeter.  The following functions are available from the option: : opens up a window from which user may load a data file. : saves the best solution found by the GA. ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl The Optimise ..."
Abstract
 Add to MetaCart
tions in this window will be described in turn. Figure 1: The window in XGAmeter.  The following functions are available from the option: : opens up a window from which user may load a data file. : saves the best solution found by the GA. ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl The Optimise
Bypassing the Embedding: Approximation schemes and Compact Representations for Low Dimensional Metrics
, 2004
"... The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of radius r. This concept for abstract metrics has been proposed as a natural analog to the dimension of a Euclidean space. If we could embed metrics with low doubling dimension into ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
into low dimensional Euclidean spaces, they would inherit several algorithmic and structural properties of the Euclidean spaces. Unfortunately however, such a restriction on dimension does not suffice to guarantee embeddibility in a normed space. In this paper we explore the option of bypassing
Improved Approximation Bounds for the Group Steiner Problem
 In Proc. Conference on Design Automation and Test in Europe
, 1998
"... Given a weighted graph and a family of k disjoint groups of nodes, the Group Steiner Problem asks for a minimumcost routing tree that contains at least one node from each group. We give polynomialtime O(k ffl )approximation algorithms for arbitrarily small values of ffl ? 0, improving on the p ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Given a weighted graph and a family of k disjoint groups of nodes, the Group Steiner Problem asks for a minimumcost routing tree that contains at least one node from each group. We give polynomialtime O(k ffl )approximation algorithms for arbitrarily small values of ffl ? 0, improving
Domain Decomposition and Multilevel Methods in Diffpack
 in Diffpack. Report STF42 A96017, SINTEF Applied Mathematics
, 1996
"... Schwarz Method We consider linear systems, Ax = f , where A arises from the discretization of a partial differential operator. The prototype solution algorithm, the additive Schwarz method, can be written as B = X j R j B j R j (2.1) with approximate solvers B j operating on a subspace V j and ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
coarse grid Schur complement iteration exact, inexact local solves Schur complement preconditioner NeumannNeumann, wirebasket with, without coarse grid The interface basically consists of ffl transfer or restriction operators such as R j and R j , ffl (approximate) subspace solvers B j , ffl
A Percolating State Selector for SuffixTree Context Models
 In Proceedings Data Compression Conference. IEEE Computer
, 1997
"... This paper introduces into practice and empirically evaluates a set of techniques for performing informationtheoretic state selection that have been developing in asymptotic results for over a decade. State selection, which actually implements the selection of an entire model from among a set of co ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
of competing models, is performed at least trivially by all of the suffixtree FSMs used for online probability estimation. The set of stateselection techniques presented here combines orthogonally with the other sets of design options covered in the companion papers, "A Generalization and Improvement
HTTP 1.0 Logs Considered Harmful
 Position Paper, W3C Web Characterization Group Workshop
, 1998
"... ion establishment a significant portion of the total latency [3, 4]. In HTTP 1.1, HTTP connections are persistent by default, to avoid the roundtrip delays, as well as the processing and bandwidth overheads of repeatedly opening and closing connections. The move to persistent connections should res ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
result in appreciable differences in the arrival times of requests from the same client (or proxy), particularly for embedded entities. In addition, the spacing of requests would be affected by the (optional) pipelining of successive HTTP requests. ffl Support for semantically transparent caching: HTTP
OPlan Tasking Specification
, 1996
"... this report is to describe the task and option management capabilities being developed for the OPlan system to allow it to be used in a mip framework to support Air Campaign Planning (acp). During first two phases of the darpa/Rome Laboratory Planning Initiative (arpi) the OPlan project concentrat ..."
Abstract
 Add to MetaCart
this report is to describe the task and option management capabilities being developed for the OPlan system to allow it to be used in a mip framework to support Air Campaign Planning (acp). During first two phases of the darpa/Rome Laboratory Planning Initiative (arpi) the OPlan project
Results 1  10
of
14