Sciweavers

199 search results - page 33 / 40
» Connectivity of addable graph classes
Sort
View
TCOM
2010
109views more  TCOM 2010»
14 years 9 months ago
Results on Finite Wireless Networks on a Line
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
Ali Eslami, Mohammad Nekoui, Hossein Pishro-Nik
AUTOMATICA
2010
130views more  AUTOMATICA 2010»
14 years 11 months ago
Discrete-time dynamic average consensus
We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely ...
Minghui Zhu, Sonia Martínez
NIPS
2003
15 years 11 days ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
76
Voted
IPCO
2007
94views Optimization» more  IPCO 2007»
15 years 13 days ago
Infrastructure Leasing Problems
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
Barbara M. Anthony, Anupam Gupta
64
Voted
CORR
2008
Springer
73views Education» more  CORR 2008»
14 years 11 months ago
On acceptance conditions for membrane systems: characterisations of L and NL
In this paper we investigate the affect of various acceptance conditions on recogniser membrane systems without dissolution. We demonstrate that two particular acceptance conditio...
Niall Murphy, Damien Woods