253 search results - page 31 / 51 » Edge and Node Searching Problems on Trees |
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
ICMLA
2007
14 years 11 months ago
2007
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
IJCAI
2003
14 years 11 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
103
click to vote
SAGT
2010
Springer
14 years 8 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...