Results 1  10
of
106
Euclidean greedy drawings of trees
 In Proc. 21st European Symposium on Algorithms
, 2013
"... Abstract. Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each sourcedestination pair of nodes s, t in a greedy embedding there is always a neighbor u of s that is closer to t according to some distance metric. The existence of gre ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each sourcedestination pair of nodes s, t in a greedy embedding there is always a neighbor u of s that is closer to t according to some distance metric. The existence
An Algorithm to Construct Greedy Drawings of Triangulations
, 2010
"... We show an algorithm to construct a greedy drawing of every given triangulation. The algorithm relies on two main results. First, we show how to construct greedy drawings of a fairly simple class of graphs, called triangulated binary cactuses. Second, we show that every triangulation can be spanned ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
We show an algorithm to construct a greedy drawing of every given triangulation. The algorithm relies on two main results. First, we show how to construct greedy drawings of a fairly simple class of graphs, called triangulated binary cactuses. Second, we show that every triangulation can be spanned
Succinct greedy graph drawing in the hyperbolic plane
 In Proc. 16th Int. Symp. Graph Drawing
, 2008
"... Abstract. We describe an efficient method for drawing any nvertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so that a message M between any pair of vertices may be routed geometrically, simply by having each vertex that r ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
Abstract. We describe an efficient method for drawing any nvertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so that a message M between any pair of vertices may be routed geometrically, simply by having each vertex
Succinct Greedy Graph Drawing in R²
, 2009
"... In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of always forwarding messages to nodes that are closer to the destination. We show that greedy graph drawing schemes exist for the Euclidean metric in R², for 3connected planar ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of always forwarding messages to nodes that are closer to the destination. We show that greedy graph drawing schemes exist for the Euclidean metric in R², for 3connected planar
Greedy Galois Games
, 2011
"... We show that twoduelers with similar, lousy shooting skills (a.k.a. Galois duelers) will choose to take turns firing in accordance with the famous ThueMorse sequence if they greedily demand their chances to fire as soon as the other’s a priori probability of winning exceeds their own. This contrast ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
is discharged, they draw up a firing sequence, i.e., the sequence of turns they will take, according to the following “greedy ” rules. Alice shoots first. Bob then shoots as many times as he needs to obtain a probability of winning that meets or exceeds the probability that Alice has won so far. Then Alice
On a greedy heuristic for complete matching
 SIAM JOURNAL ON COMPUTING
, 1981
"... Finding a minimum weighted complete matching on a set of vertices in which the distances satisfy the triangle inequality is of general interest and of particular importance when drawing graphs on a mechanical plotter. The "greedy" heuristic of repeatedly matching the two closest unmatche ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
Finding a minimum weighted complete matching on a set of vertices in which the distances satisfy the triangle inequality is of general interest and of particular importance when drawing graphs on a mechanical plotter. The "greedy" heuristic of repeatedly matching the two closest
Greedy Concepts for Network Flow Problems
 Disc. Appl. Math
, 1986
"... We provide a general theoretical framework to prove greedy results for the optimal cost flow problem. We also draw the border line to problems where greedy is not valid. In some cases polymatroid explanations can be given for the greedy behaviour. I. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We provide a general theoretical framework to prove greedy results for the optimal cost flow problem. We also draw the border line to problems where greedy is not valid. In some cases polymatroid explanations can be given for the greedy behaviour. I.
Greedy Point Match Handwriting Recognition
, 2005
"... In which we propose a new algorithm to assist in handwriting recognition. 1 Assumptions And Overview For this paper, we assume that a handwriting recognizer has access to a handwriting profile based on a large number of samples of a user’s handwriting. A user might be asked to write each letter, num ..."
Abstract
 Add to MetaCart
, number and punctuation mark that is to be recognized 20 times. In the case of letters, upper and lower case must be written separately and in all cases the glyphs must be formed in the same manner. For example, it is inappropriate for a user to sometimes draw the body of a five and then the hat and other
Commentary The Greedy Bastard’s Guide to Business
"... Greedy Bastards, eager to achieve success in the business world, need helpful advice on steps toward climbing to the top. Drawing on the author’s 35plus years of experience in teaching MBAs, the present treatise offers tips in the form of a selfhelp tutorial intended as an inspirational guide. In ..."
Abstract
 Add to MetaCart
Greedy Bastards, eager to achieve success in the business world, need helpful advice on steps toward climbing to the top. Drawing on the author’s 35plus years of experience in teaching MBAs, the present treatise offers tips in the form of a selfhelp tutorial intended as an inspirational guide
Article The Greedy Bastard’s Guide to Business
"... Greedy Bastards, eager to achieve success in the business world, need helpful advice on steps toward climbing to the top. Drawing on the author’s 35plus years of experience in teaching MBAs, the present treatise offers tips in the form of a selfhelp tutorial intended as an inspirational guide. In ..."
Abstract
 Add to MetaCart
Greedy Bastards, eager to achieve success in the business world, need helpful advice on steps toward climbing to the top. Drawing on the author’s 35plus years of experience in teaching MBAs, the present treatise offers tips in the form of a selfhelp tutorial intended as an inspirational guide
Results 1  10
of
106