Sciweavers

499 search results - page 87 / 100
» A Search Algorithm for Clusters in a Network or Graph
Sort
View
GECCO
2007
Springer
201views Optimization» more  GECCO 2007»
14 years 1 months ago
A parallel framework for loopy belief propagation
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....
Alexander Mendiburu, Roberto Santana, Jose Antonio...
ATAL
2009
Springer
14 years 2 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
WWW
2004
ACM
14 years 8 months ago
Propagation of trust and distrust
A (directed) network of people connected by ratings or trust scores, and a model for propagating those trust scores, is a fundamental building block in many of today's most s...
Ramanathan V. Guha, Ravi Kumar, Prabhakar Raghavan...
SAC
2004
ACM
14 years 1 months ago
Time-frequency feature detection for time-course microarray data
Gene clustering based on microarray data provides useful functional information to the working biologists. Many current gene-clustering algorithms rely on Euclidean-based distance...
Jiawu Feng, Paolo Emilio Barbano, Bud Mishra
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
13 years 12 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han