Results 1  10
of
3,933
A Framework for Comparing Models of Computation
 IEEE TRANSACTIONS ON COMPUTERAIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
, 1998
"... We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general terms as sets of possible behaviors. A process is determinate if, given the constraints imposed by the inputs, there are exactly o ..."
Abstract

Cited by 322 (67 self)
 Add to MetaCart
We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general terms as sets of possible behaviors. A process is determinate if, given the constraints imposed by the inputs, there are exactly
A survey of content based 3D shape retrieval methods
 Multimedia Tools and Applications
, 2008
"... Recent developments in techniques for modeling, digitizing and visualizing 3D shapes has led to an explosion in the number of available 3D models on the Internet and in domainspecific databases. This has led to the development of 3D shape retrieval systems that, given a query object, retrieve simil ..."
Abstract

Cited by 289 (1 self)
 Add to MetaCart
similar 3D objects. For visualization, 3D shapes are often represented as a surface, in particular polygonal meshes, for example in VRML format. Often these models contain holes, intersecting polygons, are not manifold, and do not enclose a volume unambiguously. On the contrary, 3D volume models
Equivariant Intersection Theory
 Invent. Math
, 1996
"... this paper is to develop an equivariant intersection theory for actions of linear algebraic groups on algebraic schemes. The theory is based on our construction of equivariant Chow groups. They are algebraic analogues of equivariant cohomology groups which have all the functorial properties of ordin ..."
Abstract

Cited by 161 (18 self)
 Add to MetaCart
this paper is to develop an equivariant intersection theory for actions of linear algebraic groups on algebraic schemes. The theory is based on our construction of equivariant Chow groups. They are algebraic analogues of equivariant cohomology groups which have all the functorial properties
Robust Linear Programming Discrimination Of Two Linearly Inseparable Sets
, 1992
"... INTRODUCTION We consider the two pointsets A and B in the ndimensional real space R n represented by the m \Theta n matrix A and the k \Theta n matrix B respectively. Our principal objective here is to formulate a single linear program with the following properties: (i) If the convex hulls of A ..."
Abstract

Cited by 239 (32 self)
 Add to MetaCart
INTRODUCTION We consider the two pointsets A and B in the ndimensional real space R n represented by the m \Theta n matrix A and the k \Theta n matrix B respectively. Our principal objective here is to formulate a single linear program with the following properties: (i) If the convex hulls
Combining Partial Order Reductions with Onthefly Modelchecking
, 1994
"... Abstract Partial order modelchecking is an approach to reduce time and memory in modelchecking concurrent programs. Onthefly modelchecking is a technique to eliminate part of the search by intersecting an automaton representing the (negation of the) checked property with the state space during i ..."
Abstract

Cited by 212 (14 self)
 Add to MetaCart
Abstract Partial order modelchecking is an approach to reduce time and memory in modelchecking concurrent programs. Onthefly modelchecking is a technique to eliminate part of the search by intersecting an automaton representing the (negation of the) checked property with the state space during
How to assign votes in a distributed system
 Journal of the ACM
, 1985
"... Abstract. In a distributed system, one strategy for achieving mutual exclusion of groups of nodes without communication is to assign to each node a number of votes. Only a group with a majority of votes can execute the critical operations, and mutual exclusion is achieved because at any given time t ..."
Abstract

Cited by 204 (3 self)
 Add to MetaCart
there is at most one such group. A second strategy, which appears to be similar to votes, is to define a priori a set of groups that intersect each other. Any group of nodes that finds itself in this set can perform the restricted operations. In this paper, both of these strategies are studied in detail
Intersection of . . .
, 2003
"... We show that it is consistent with ZFC that the intersection of some family of less than 2 ℵ0 ultrafilters can have measure zero. This answers a question of D. Fremlin. The goal of this paper is to prove the theorem in the title. The solution is due to the second author. Throughout the paper we us ..."
Abstract
 Add to MetaCart
We show that it is consistent with ZFC that the intersection of some family of less than 2 ℵ0 ultrafilters can have measure zero. This answers a question of D. Fremlin. The goal of this paper is to prove the theorem in the title. The solution is due to the second author. Throughout the paper we
Two dimensional gauge theories revisited
 J. Geom. Phys
, 1992
"... Two dimensional quantum YangMills theory is reexamined using a nonabelian version of the DuistermaatHeckman integration formula to carry out the functional integral. This makes it possible to explain properties of the theory that are inaccessible to standard methods and to obtain general expressi ..."
Abstract

Cited by 200 (3 self)
 Add to MetaCart
Two dimensional quantum YangMills theory is reexamined using a nonabelian version of the DuistermaatHeckman integration formula to carry out the functional integral. This makes it possible to explain properties of the theory that are inaccessible to standard methods and to obtain general
Applying interval arithmetic to real, integer and Boolean constraints
, 1997
"... We present in this paper a uni ed processing for Real, Integer and Boolean Constraints based on a general narrowing algorithm which applies to any nary relation on <. The basic idea is to de ne, for every such relation, a narrowing function;! based on the approximation of by a Cartesian product ..."
Abstract

Cited by 187 (22 self)
 Add to MetaCart
of intervals whose bounds are oating point numbers. We then focus on nonconvex relations and establish several properties. The more important of these properties is applied to justify the computation of usual relations de ned in terms of intersections of simpler relations. We extend the scope of the narrowing
Shellable nonpure complexes and posets. I
 TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY
, 1996
"... The concept of shellability of complexes is generalized by deleting the requirement of purity (i.e., that all maximal faces have the same dimension). The usefulness of this level of generality was suggested by certain examples coming from the theory of subspace arrangements. We develop several of ..."
Abstract

Cited by 183 (8 self)
 Add to MetaCart
of the basic properties of the concept of nonpure shellability. Doubly indexed fvectors and hvectors are introduced, and the latter are shown to be nonnegative in the shellable case. Shellable complexes have the homotopy type of a wedge of spheres of various dimensions, and their StanleyReisner rings admit
Results 1  10
of
3,933