Sciweavers

1650 search results - page 148 / 330
» The HOM problem is decidable
Sort
View
STOC
1998
ACM
129views Algorithms» more  STOC 1998»
15 years 8 months ago
Planar Map Graphs
We introduce and study a modi ed notion of planarity, in which two regions of a map are considered adjacent when they share any point of their boundaries not an edge, as standard...
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. P...
ICCAD
1997
IEEE
101views Hardware» more  ICCAD 1997»
15 years 8 months ago
NRG: global and detailed placement
We present a new approach to the placement problem. The proposed approach consists of analyzing the input circuit and deciding on a two-dimensional global grid for that particular...
Majid Sarrafzadeh, Maogang Wang
CONCUR
2009
Springer
15 years 8 months ago
Weak Time Petri Nets Strike Back!
We consider the model of Time Petri Nets where time is associated with transitions. Two semantics for time elapsing can be considered: the strong one, for which all transitions are...
Pierre-Alain Reynier, Arnaud Sangnier
GLOBECOM
2007
IEEE
15 years 8 months ago
Bursty Traffic in Energy-Constrained Opportunistic Spectrum Access
We design opportunistic spectrum access strategies for improving spectrum efficiency. In each slot, a secondary user chooses a subset of channels to sense and decides whether to ac...
Yunxia Chen, Qing Zhao, Ananthram Swami
ICDT
2007
ACM
105views Database» more  ICDT 2007»
15 years 8 months ago
Unlocking Keys for XML Trees
Abstract. We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomati...
Sven Hartmann, Sebastian Link