Sciweavers

307 search results - page 4 / 62
» Low-Distortion Embeddings of Trees
Sort
View
TALG
2008
81views more  TALG 2008»
13 years 7 months ago
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin F...
IWOCA
2009
Springer
137views Algorithms» more  IWOCA 2009»
14 years 2 months ago
Embedded Trees and the Support of the ISE
Embedded trees are labelled rooted trees, where the root has zero label and where the labels of adjacent vertices differ (at most) by
Michael Drmota
IJIS
2011
83views more  IJIS 2011»
12 years 11 months ago
Conceptual modeling in full computation-tree logic with sequence modal operator
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...
Ken Kaneiwa, Norihiro Kamide
RTAS
2010
IEEE
13 years 5 months ago
Improved Task Management Techniques for Enforcing EDF Scheduling on Recurring Tasks
The management of tasks is an essential requirement in most real-time and embedded systems, but invariably leads to unwanted CPU overheads. This paper is concerned with task manage...
Michael Short
DMTCS
2010
125views Mathematics» more  DMTCS 2010»
13 years 5 months ago
Binary Labelings for Plane Quadrangulations and their Relatives
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
Stefan Felsner, Clemens Huemer, Sarah Kappes, Davi...