1554 search results - page 175 / 311 » Parameterized Complexity and Approximation Algorithms |
150
click to vote
TSP
2010
14 years 10 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
143
Voted
POPL
2010
ACM
16 years 22 days ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
103
click to vote
SIGECOM
2005
ACM
15 years 9 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
127
click to vote
DIS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In this paper, we consider 0/1 databases and provide an alternative way of extracting knowledge from such databases using tiles. A tile is a region in the database consis...
123
Voted
GBRPR
2009
Springer
15 years 8 months ago
2009
Springer
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...