4171 search results - page 660 / 835 » Choice numbers of graphs |
181
click to vote
COLT
2003
Springer
15 years 11 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
192
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
205
click to vote
IEEEMSP
2002
IEEE
15 years 11 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
181
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Let (S, d) be a finite metric space, where each element p ∈ S has a non-negative weight w(p). We study spanners for the set S with respect to weighted distance function dw, wher...
169
click to vote
ICCAD
2000
IEEE
15 years 11 months ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...