9532 search results - page 437 / 1907 » Logic, Graphs, and Algorithms |
213
click to vote
IPL
2008
15 years 6 months ago
2008
Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k. Key words: approximation algorithm,...
304
Voted
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—This paper addresses the problem of identifying the top-k information hubs in a social network. Identifying topk information hubs is crucial for many applications such as advert...
219
Voted
LANMR
2004
15 years 8 months ago
2004
In previous work we have discussed the importance of identifying the cycles that occur in a logic program under the answer set semantics, and the connections between cycles, that w...
197
Voted
BIBE
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract—This paper develops an algorithm for NMR backbone resonance assignment given a 3D structure and a set of relatively sparse 15 N-edited NMR data, with the through-space 1...
164
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...