Sciweavers

281 search results - page 18 / 57
» On Embedding a Graph on Two Sets of Points
Sort
View
DIS
2009
Springer
15 years 4 months ago
CHRONICLE: A Two-Stage Density-Based Clustering Algorithm for Dynamic Networks
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...
Min-Soo Kim 0002, Jiawei Han
CORR
2008
Springer
150views Education» more  CORR 2008»
14 years 9 months ago
Message-passing for Maximum Weight Independent Set
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky
SDM
2007
SIAM
126views Data Mining» more  SDM 2007»
14 years 11 months ago
Nonlinear Dimensionality Reduction using Approximate Nearest Neighbors
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-d...
Erion Plaku, Lydia E. Kavraki
GECCO
2000
Springer
113views Optimization» more  GECCO 2000»
15 years 1 months ago
A Non-Linear Schema Theorem for Genetic Algorithms
We generalize Holland's Schema Theorem to the setting that genes are arranged, not necessarily in a linear sequence, but as the nodes in a connected graph. We have experiment...
William A. Greene
EJC
2008
14 years 9 months ago
A classification of finite partial linear spaces with a primitive rank 3 automorphism group of grid type
A partial linear space is a non-empty set of points, provided with a collection of subsets called lines such that any pair of points is contained in at most one line and every lin...
Alice Devillers