3471 search results - page 603 / 695 » Obstacle Numbers of Graphs |
173
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
151
Voted
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
Orthogonal Variable Spreading Factor (OVSF) CDMA code has the ability to support higher and variable data rates with a single code using one transceiver. A number of CDMA code ass...
149
Voted
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
It has recently been observed that the node degrees of many real-world large-scale networks, such as the Internet and the Web, follow a power law distributions. Since the classical...
153
click to vote
DAGM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We consider the classification problem on a finite set of objects. Some of them are labeled, and the task is to predict the labels of the remaining unlabeled ones. Such...
142
Voted
EMMCVPR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...