Results 1  10
of
24,367
The process group approach to reliable distributed computing
 Communications of the ACM
, 1993
"... The difficulty of developing reliable distributed softwme is an impediment to applying distributed computing technology in many settings. Expeti _ with the Isis system suggests that a structured approach based on virtually synchronous _ groups yields systems that are substantially easier to develop, ..."
Abstract

Cited by 572 (19 self)
 Add to MetaCart
, exploit sophisticated forms of cooperative computation, and achieve high reliability. This paper reviews six years of resemr,.hon Isis, describing the model, its impl_nentation challenges, and the types of applicatiom to which Isis has been appfied. 1 In oducfion One might expect the reliability of a
HOMOGENIZATION AND TWOSCALE CONVERGENCE
, 1992
"... Following an idea of G. Nguetseng, the author defines a notion of "twoscale" convergence, which is aimed at a better description of sequences of oscillating functions. Bounded sequences in L2(f) are proven to be relatively compact with respect to this new type of convergence. A corrector ..."
Abstract

Cited by 451 (14 self)
 Add to MetaCart
Following an idea of G. Nguetseng, the author defines a notion of "twoscale" convergence, which is aimed at a better description of sequences of oscillating functions. Bounded sequences in L2(f) are proven to be relatively compact with respect to this new type of convergence. A correctortype
Query expansion using lexicalsemantic relations
 In Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
, 1994
"... Applications such as office automation, news filtering, help facilities in complex systems, and the like require the ability to retrieve documents from fulltext databases where vocabulary problems can be particularly severe. Experiments performed on small collections with singledomain thesauri sug ..."
Abstract

Cited by 395 (1 self)
 Add to MetaCart
Net synonym sets and are expanded by following the typed links included in Word Net. Experimental results show this query expansion technique makes little difference in retrieval effectiveness if the original queries are relatively complete descriptions of the information being sought even when the concepts
SDPT3  a MATLAB software package for semidefinite programming
 OPTIMIZATION METHODS AND SOFTWARE
, 1999
"... This software package is a Matlab implementation of infeasible pathfollowing algorithms for solving standard semidefinite programming (SDP) problems. Mehrotratype predictorcorrector variants are included. Analogous algorithms for the homogeneous formulation of the standard SDP problem are also imp ..."
Abstract

Cited by 361 (16 self)
 Add to MetaCart
implemented. Four types of search directions are available, namely, the AHO, HKM, NT, and GT directions. A few classes of SDP problems are included as well. Numerical results for these classes show that our algorithms are fairly efficient and robust on problems with dimensions of the order of a few hundreds.
Keyword searching and browsing in databases using BANKS
 In ICDE
, 2002
"... With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of query languages; even relatively simple query languages designed for nonexperts are too complicated for them. We describe BA ..."
Abstract

Cited by 321 (14 self)
 Add to MetaCart
keywords, following hyperlinks, and interacting with controls on the displayed results. BANKS models tuples as nodes in a graph, connected by links induced by foreign key and other relationships. Answers to a query are modeled as rooted trees connecting tuples that match individual keywords in the query
The monadic secondorder logic of graphs I. Recognizable sets of Finite Graphs
 Information and Computation
, 1990
"... The notion of a recognizable sef offinite graphs is introduced. Every set of finite graphs, that is definable in monadic secondorder logic is recognizable, but not vice versa. The monadic secondorder theory of a contextfree set of graphs is decidable. 0 19W Academic Press. Inc. This paper begins ..."
Abstract

Cited by 301 (17 self)
 Add to MetaCart
be found in Courcelle [ 111. An algebraic structure on the set of graphs (in the above sense) has been proposed by Bauderon and Courcelle [2,7]. The notion of a recognizable set of finite graphs follows, as an instance of the general notion of recognizability introduced by Mezei and Wright in [25]. A graph
The stages of economic growth.
 Economic History Review , 2nd series 12,
, 1959
"... JSTOR is a notforprofit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about J ..."
Abstract

Cited by 297 (0 self)
 Add to MetaCart
innovations: they are also partially determined by those types of demand which have exhibited high elasticity with respect to price, income, or both. The demand for resources has resulted, however, not merely from demands set up by private taste and choice, but also from social decisions and from the 1 In a
MORE RESULTS ON RAMSEYTURAN TYPE PROBLEMS
, 1983
"... The paper deals with common generalizations of classical results of Ramsey and TurSn. The following is one of the main results. Assume k2, 6=+O, G,, is 3 sequence oi ‘ graphs of?Ivertices and at least i(g+ +E PP edges, and the size of the largest independent set in G, is @I). Let H be any graph of ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
The paper deals with common generalizations of classical results of Ramsey and TurSn. The following is one of the main results. Assume k2, 6=+O, G,, is 3 sequence oi ‘ graphs of?Ivertices and at least i(g+ +E PP edges, and the size of the largest independent set in G, is @I). Let H be any graph
Ramseytype results for semialgebraic relations
, 2012
"... For natural numbers d and t there exists a positive C such that if F is a family of n C semialgebraic sets in R d of description complexity at most t, then there is a subset F ′ of F of size n such that either every pair of elements in F ′ intersect or the elements of F ′ are pairwise disjoint. This ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
. This result, which also holds if the intersection relation is replaced by any semialgebraic relation of bounded description complexity, was proved by Alon, Pach, Pinchasi, Radoičić, and Sharir and improves on a bound of 4 n for the family F which follows from a straightforward application of Ramsey’s theorem
Results 1  10
of
24,367