Sciweavers

TON
2008
122views more  TON 2008»
13 years 9 months ago
Distributed throughput maximization in wireless mesh networks via pre-partitioning
Abstract-- This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number ...
Andrew Brzezinski, Gil Zussman, Eytan Modiano
TON
2008
79views more  TON 2008»
13 years 9 months ago
Asynchronous congestion control in multi-hop wireless networks with maximal matching-based scheduling
We consider a multi-hop wireless network shared by many users. For an interference model that constrains a node to either transmit to or receive from only one other node at a time,...
Loc Bui, Atilla Eryilmaz, R. Srikant, Xinzhou Wu
TON
2008
119views more  TON 2008»
13 years 9 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
TON
2008
86views more  TON 2008»
13 years 9 months ago
Faster algorithms for construction of recovery trees enhancing QoP and QoS
M
Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan ...
JGAA
2007
142views more  JGAA 2007»
13 years 9 months ago
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
Kerri Morgan, Graham Farr
JGAA
2007
135views more  JGAA 2007»
13 years 9 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
TOMS
2008
120views more  TOMS 2008»
13 years 9 months ago
Families of algorithms related to the inversion of a Symmetric Positive Definite matrix
We present families of algorithms for operations related to the computation of the inverse of a Symmetric Positive Definite (SPD) matrix: Cholesky factorization, inversion of a tr...
Paolo Bientinesi, Brian C. Gunter, Robert A. van d...
JDA
2007
83views more  JDA 2007»
13 years 9 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes
JDA
2007
97views more  JDA 2007»
13 years 9 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia
TOG
2008
143views more  TOG 2008»
13 years 9 months ago
Discovering structural regularity in 3D geometry
We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an e...
Mark Pauly, Niloy J. Mitra, Johannes Wallner, Helm...