Sciweavers

646 search results - page 76 / 130
» Generalized connected domination in graphs
Sort
View
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
14 years 9 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
14 years 3 months ago
Local Probabilistic Models for Link Prediction
One of the core tasks in social network analysis is to predict the formation of links (i.e. various types of relationships) over time. Previous research has generally represented ...
Chao Wang, Venu Satuluri, Srinivasan Parthasarathy
NIPS
2003
13 years 10 months 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
ICRA
2005
IEEE
124views Robotics» more  ICRA 2005»
14 years 2 months ago
Sensor-based Planning for Planar Multi-Convex Rigid Bodies
— This paper presents a method for a planar rigid body consisting of multiple convex bodies to explore an unknown planar workspace, i.e., an unknown configuration space diffeomo...
Ji Yeong Lee, Howie Choset
IPSN
2004
Springer
14 years 2 months ago
Naps: scalable, robust topology management in wireless ad hoc networks
Topology management schemes conserve energy in wireless ad hoc networks by identifying redundant nodes that may turn off their radios or other components while maintaining connec...
Brighten Godfrey, David Ratajczak