1040 search results - page 105 / 208 » Rounding algorithms for covering problems |
100
click to vote
JCSS
2008
14 years 10 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
WWW
2006
ACM
15 years 10 months ago
2006
ACM
We consider the problem of visualizing the evolution of tags within the Flickr (flickr.com) online image sharing community. Any user of the Flickr service may append a tag to any ...
108
click to vote
UIC
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the l...
NDSS
2009
IEEE
15 years 4 months ago
2009
IEEE
Coordinated attacks, where the tasks involved in an attack are distributed amongst multiple sources, can be used by an adversary to obfuscate his incursion. In this paper we prese...
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...