7129 search results - page 798 / 1426 » Approximation Algorithms for Treewidth |
171
click to vote
IPPS
2005
IEEE
16 years 3 days ago
2005
IEEE
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
163
click to vote
WADS
2005
Springer
15 years 12 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
178
click to vote
STOC
2003
ACM
15 years 11 months ago
2003
ACM
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
179
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
150
click to vote
ICANN
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. This paper proposes a general approach named ExpectationMiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Ex...