Results 1  10
of
16,322
Simple extensions of combinatorial structures
, 2010
"... An interval in a combinatorial structure R is a set I of points which are related to every point in R \ I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a simple structure by structures of smaller sizes — this i ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
An interval in a combinatorial structure R is a set I of points which are related to every point in R \ I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a simple structure by structures of smaller sizes
The strong Lefschetz property and simple extensions
"... Abstract. Stanley [4] showed that monomial complete intersections have the strong Lefschetz property. Extending this result we show that a simple extension of an Artinian Gorenstein algebra with the strong Lefschetz property has again the strong Lefschetz property. ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
Abstract. Stanley [4] showed that monomial complete intersections have the strong Lefschetz property. Extending this result we show that a simple extension of an Artinian Gorenstein algebra with the strong Lefschetz property has again the strong Lefschetz property.
A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood
, 2003
"... The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction methods. We describe a new approach, based on the maximumlikelihood principle, which clearly satisfies these requirements. The ..."
Abstract

Cited by 2182 (27 self)
 Add to MetaCart
. The core of this method is a simple hillclimbing algorithm that adjusts tree topology and branch lengths simultaneously. This algorithm starts from an initial tree built by a fast distancebased method and modifies this tree to improve its likelihood at each iteration. Due to this simultaneous adjustment
Algebraic laws for nondeterminism and concurrency
 Journal of the ACM
, 1985
"... Abstract. Since a nondeterministic and concurrent program may, in general, communicate repeatedly with its environment, its meaning cannot be presented naturally as an input/output function (as is often done in the denotational approach to semantics). In this paper, an alternative is put forth. Firs ..."
Abstract

Cited by 608 (13 self)
 Add to MetaCart
observation congruence class. The paper demonstrates, for a sequence of simple languages expressing finite (terminating) behaviors, that in each case observation congruence can be axiomatized algebraically. Moreover, with the addition of recursion and another simple extension, the algebraic language described
SOME SIMPLE EXTENSIONS OF EULERIAN LATTICES
"... Abstract. Let L be a lattice. If K is a sublattice of L, then L is called an extension of K. Lattice extension concept was elaborately studied by G. Grätzer and E. T. Schmidt in their papers [6], [7], [9], [10]. A lattice L is said to be simple if it has no nontrivial congruences. A finite graded ..."
Abstract
 Add to MetaCart
Abstract. Let L be a lattice. If K is a sublattice of L, then L is called an extension of K. Lattice extension concept was elaborately studied by G. Grätzer and E. T. Schmidt in their papers [6], [7], [9], [10]. A lattice L is said to be simple if it has no nontrivial congruences. A finite
The design of an acquisitional query processor for sensor networks
 In SIGMOD
, 2003
"... We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs of acq ..."
Abstract

Cited by 523 (25 self)
 Add to MetaCart
of acquiring data, we are able to significantly reduce power consumption over traditional passive systems that assume the a priori existence of data. We discuss simple extensions to SQL for controlling data acquisition, and show how acquisitional issues influence query optimization, dissemination
Tinydb: An acquisitional query processing system for sensor networks
 ACM Trans. Database Syst
, 2005
"... We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs of acq ..."
Abstract

Cited by 626 (8 self)
 Add to MetaCart
of acquiring data, we are able to significantly reduce power consumption over traditional passive systems that assume the a priori existence of data. We discuss simple extensions to SQL for controlling data acquisition, and show how acquisitional issues influence query optimization, dissemination
The Security of DESX A simple extension of
"... been shown to be virtually immune to exhaustive key search. The work to DESX encrypt a message block is just two XORs more than the work to DES encrypt a message block. ..."
Abstract
 Add to MetaCart
been shown to be virtually immune to exhaustive key search. The work to DESX encrypt a message block is just two XORs more than the work to DES encrypt a message block.
Results 1  10
of
16,322