9 search results - page 2 / 2 » Extremal Graph Theory for Metric Dimension and Diameter |
214
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
170
click to vote
PODC
2005
ACM
16 years 5 days ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
206
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
182
click to vote
SIGIR
2005
ACM
16 years 5 days ago
2005
ACM
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...