356 search results - page 52 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
103
click to vote
BMCBI
2010
15 years 17 days ago
2010
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
121
click to vote
COMBINATORICS
2002
15 years 8 days ago
2002
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
118
Voted
CIKM
2010
Springer
14 years 7 months ago
2010
Springer
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
115
Voted
CIKM
2011
Springer
14 years 13 days ago
2011
Springer
We consider the problem of link prediction in signed networks. Such networks arise on the web in a variety of ways when users can implicitly or explicitly tag their relationship w...
124
Voted
KDD
2012
ACM
13 years 2 months ago
2012
ACM
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...