Sciweavers

113 search results - page 21 / 23
» When can a graph form an orthogonal polyhedron
Sort
View
WSDM
2010
ACM
214views Data Mining» more  WSDM 2010»
14 years 4 months ago
You are who you know: Inferring user profiles in Online Social Networks
Online social networks are now a popular way for users to connect, express themselves, and share content. Users in today's online social networks often post a profile, consis...
Alan Mislove, Bimal Viswanath, P. Krishna Gummadi,...
AAAI
2010
13 years 8 months ago
Coalition Structure Generation based on Distributed Constraint Optimization
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
Suguru Ueda, Atsushi Iwasaki, Makoto Yokoo, Marius...
BMCBI
2008
228views more  BMCBI 2008»
13 years 7 months ago
Adaptive diffusion kernel learning from biological networks for protein function prediction
Background: Machine-learning tools have gained considerable attention during the last few years for analyzing biological networks for protein function prediction. Kernel methods a...
Liang Sun, Shuiwang Ji, Jieping Ye
ECMDAFA
2005
Springer
130views Hardware» more  ECMDAFA 2005»
14 years 26 days ago
Control Flow Analysis of UML 2.0 Sequence Diagrams
This article presents a control flow analysis methodology based on UML 2.0 sequence diagrams (SD). In contrast to the conventional code-based control flow analysis techniques, thi...
Vahid Garousi, Lionel C. Briand, Yvan Labiche
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
14 years 22 days ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor