429 search results - page 53 / 86 » Solving the Maximum Clique Problem Using PUBB |
105
click to vote
TON
2002
15 years 2 months ago
2002
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
125
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
105
click to vote
IWANN
1999
Springer
15 years 7 months ago
1999
Springer
Abstract: Support vector machines (SVMs) are primarily designed for 2-class classification problems. Although in several papers it is mentioned that the combination of K SVMs can b...
126
click to vote
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...
143
click to vote
MOBIHOC
2009
ACM
16 years 3 months ago
2009
ACM
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...