2069 search results - page 152 / 414 » Linear time algorithms for Clobber |
138
click to vote
PRL
2010
14 years 11 months ago
2010
It is desirable to find unusual data objects by Ramaswamy et al's distance-based outlier definition because only a metric distance function between two objects is required. It...
138
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
128
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
140
Voted
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...
146
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...