Sciweavers

172 search results - page 18 / 35
» Planar Graphs with Topological Constraints
Sort
View
EMNLP
2006
13 years 11 months ago
Inducing Temporal Graphs
We consider the problem of constructing a directed acyclic graph that encodes temporal relations found in a text. The unit of our analysis is a temporal segment, a fragment of tex...
Philip Bramsen, Pawan Deshpande, Yoong Keok Lee, R...
OA
1989
237views Algorithms» more  OA 1989»
14 years 1 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
DATE
1997
IEEE
133views Hardware» more  DATE 1997»
14 years 2 months ago
Hierarchical scheduling and allocation of multirate systems on heterogeneous multiprocessors
This paper describes new algorithms for systemlevel software synthesis, namely the scheduling and allocation of a set of complex tasks running at multiple rates on a heterogeneous...
Yanbing Li, Wayne Wolf
ISSAC
2007
Springer
146views Mathematics» more  ISSAC 2007»
14 years 4 months ago
Fast and exact geometric analysis of real algebraic plane curves
An algorithm is presented for the geometric analysis of an algebraic curve f(x, y) = 0 in the real affine plane. It computes a cylindrical algebraic decomposition (CAD) of the pla...
Arno Eigenwillig, Michael Kerber, Nicola Wolpert
CEC
2007
IEEE
14 years 4 months ago
Graph design by graph grammar evolution
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...
Martin H. Luerssen, David M. W. Powers