Sciweavers

651 search results - page 89 / 131
» Selectivity estimation in spatial networks
Sort
View
AAAI
2011
12 years 8 months ago
Sparse Matrix-Variate t Process Blockmodels
We consider the problem of modeling network interactions and identifying latent groups of network nodes. This problem is challenging due to the facts i) that the network nodes are...
Zenglin Xu, Feng Yan, Yuan Qi
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 11 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
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
14 years 2 months ago
An analysis of the effects of population structure on scalable multiobjective optimization problems
Multiobjective evolutionary algorithms (MOEA) are an effective tool for solving search and optimization problems containing several incommensurable and possibly conflicting objec...
Michael Kirley, Robert L. Stewart
IMC
2003
ACM
14 years 2 months ago
Tomography-based overlay network monitoring
Overlay network monitoring enables distributed Internet applications to detect and recover from path outages and periods of degraded performance within seconds. For an overlay net...
Yan Chen, David Bindel, Randy H. Katz
SASO
2008
IEEE
14 years 3 months ago
Empirical Characterization of Discretization Error in Gradient-Based Algorithms
Many self-organizing and self-adaptive systems use the biologically inspired “gradient” primitive, in which each device in a network estimates its distance to the closest devi...
Jonathan Bachrach, Jacob Beal, Joshua Horowitz, Da...