2996 search results - page 360 / 600 » Numberings and Randomness |
200
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...
160
Voted
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
176
Voted
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
224
click to vote
DAWAK
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
190
click to vote
DCC
1998
IEEE
15 years 11 months ago
1998
IEEE
Multiple description coding (MDC) is source coding for multiple channels such that a decoder which receives an arbitrary subset of the channels may produce a useful reconstruction...