Sciweavers

9949 search results - page 149 / 1990
» On the Network Complexity of Selection
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 7 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
AMC
2008
78views more  AMC 2008»
15 years 4 months ago
Information processing in complex networks: Graph entropy and information functionals
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
Matthias Dehmer
CDC
2009
IEEE
122views Control Systems» more  CDC 2009»
15 years 2 months ago
Reduced complexity models in the identification of dynamical networks: Links with sparsification problems
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
Donatello Materassi, Giacomo Innocenti, Laura Giar...
IJCSS
2000
117views more  IJCSS 2000»
15 years 4 months ago
Direct adaptive neural control for turning complex rotating profiles
Abstract. During the machining process of a complex rotating pro
Tingzhang Lui, Xinzhong Li
BROADNETS
2006
IEEE
15 years 10 months ago
Complexity of Converter Placement Supporting Broadcast in WDM Networks
Abstract— Wavelength converters simplify the wavelength assignment problem in virtual topology design in optical networks and increase the utilization of the fiber bandwidth. Ho...
Rudra Dutta, Prashant Iyer, Carla D. Savage