185 search results - page 2 / 37 » Local Algorithms for Finding Interesting Individuals in Larg... |
CEC
2009
IEEE
13 years 9 months ago
2009
IEEE
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
EDBT
2012
ACM
11 years 7 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
ICDM
2010
IEEE
13 years 2 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
SDM
2009
SIAM
14 years 2 months ago
2009
SIAM
Although a large body of work are devoted to finding communities in static social networks, only a few studies examined the dynamics of communities in evolving social networks. I...