811 search results - page 29 / 163 » An efficient algorithm for the configuration problem of domi... |
INFOCOM
2002
IEEE
14 years 17 days ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
NIPS
2008
13 years 9 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
WG
2009
Springer
14 years 2 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
JMLR
2006
13 years 7 months ago
2006
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
RECOMB
2007
Springer
14 years 8 months ago
2007
Springer
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...