Sciweavers

123 search results - page 7 / 25
» Graph Orientation Algorithms to Minimize the Maximum Outdegr...
Sort
View
SWAT
2004
Springer
156views Algorithms» more  SWAT 2004»
15 years 7 months ago
The Bottleneck Problem with Minimum Quantity Commitments
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
Andrew Lim, Zhou Xu
INFOCOM
2007
IEEE
15 years 8 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
XSYM
2009
Springer
264views Database» more  XSYM 2009»
15 years 8 months ago
From Entity Relationship to XML Schema: A Graph-Theoretic Approach
Abstract. We propose a mapping from the Enhanced Entity Relationship conceptual model to the W3C XML Schema Language with the following properties: information and integrity constr...
Massimo Franceschet, Donatella Gubiani, Angelo Mon...
SECON
2010
IEEE
14 years 11 months ago
Placement and Orientation of Rotating Directional Sensors
In this paper, we address several problems that arise in the context of rotating directional sensors. Rotating directional sensors (RDS) have a "directional" coverage reg...
Giordano Fusco, Himanshu Gupta
BMCBI
2010
178views more  BMCBI 2010»
15 years 1 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...