3471 search results - page 647 / 695 » Obstacle Numbers of Graphs |
134
Voted
AAAI
2010
15 years 5 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
117
Voted
AAAI
2006
15 years 5 months ago
2006
Identifying intrinsic structures in large networks is a fundamental problem in many fields, such as engineering, social science and biology. In this paper, we are concerned with c...
127
Voted
NSDI
2004
15 years 5 months ago
2004
Reducing management costs and improving the availability of large-scale distributed systems require automatic replica regeneration, i.e., creating new replicas in response to repl...
153
Voted
SODA
2003
ACM
15 years 5 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
162
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...