3757 search results - page 606 / 752 » The overlap number of a graph |
172
click to vote
PAM
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
187
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...
204
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...
180
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...
168
click to vote
ICCAD
2000
IEEE
15 years 10 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...