3708 search results - page 73 / 742 » Approximating Betweenness Centrality |
103
click to vote
LPNMR
2005
Springer
15 years 6 months ago
2005
Springer
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
102
Voted
CP
2006
Springer
15 years 4 months ago
2006
Springer
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential param...
95
Voted
NIPS
2003
15 years 1 months ago
2003
We consider the question of how well a given distribution can be approximated with probabilistic graphical models. We introduce a new parameter, effective treewidth, that captures...
101
click to vote
ESA
2006
Springer
15 years 4 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
103
Voted
ALMOB
2006
15 years 19 days ago
2006
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...