Sciweavers

1633 search results - page 202 / 327
» Planar Map Graphs
Sort
View
ENTCS
2006
117views more  ENTCS 2006»
13 years 10 months ago
Interpreting SWRL Rules in RDF Graphs
An unresolved issue in SWRL (the Semantic Web Rule Language) is whether the intended semantics of its RDF representation can be described as an extension of the W3C RDF semantics....
Jing Mei, Harold Boley
IPPS
1998
IEEE
14 years 2 months ago
A Performance Evaluation of CP List Scheduling Heuristics for Communication Intensive Task Graphs
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
Benjamin S. Macey, Albert Y. Zomaya
DAC
1997
ACM
14 years 2 months ago
Data Memory Minimisation for Synchronous Data Flow Graphs Emulated on DSP-FPGA Targets
The paper presents an algorithm to determine the close-tosmallest possible data buffer sizes for arbitrary synchronous data flow (SDF) applications, such that we can guarantee the...
Marleen Adé, Rudy Lauwereins, J. A. Peperst...
IJVR
2008
166views more  IJVR 2008»
13 years 10 months ago
Context Sensitive Stylesheets for Scene Graphs
Augmented Reality (AR) enables users to visualize synthetic information overlaid on a real video stream. Such visualization is achieved by tools that vary depending on the underlyi...
Erick Méndez, Dieter Schmalstieg
JGT
2011
109views more  JGT 2011»
13 years 5 months ago
Total weight choosability of graphs
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...
Tsai-Lien Wong, Xuding Zhu