3DPVT
2002
IEEE
13 years 9 months ago
2002
IEEE
Techniques are presented to progressively approximate and compress in a lossless manner two-colored (i.e. binary) 3D objects (as well as objects of arbitrary dimensionality). The ...
FCT
2003
Springer
13 years 10 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
SBIA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. The aim of this paper is to study a family of logics that approximates classical inference, in which every step in the approximation can be decided in polynomial time. Fo...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
ADHOCNOW
2004
Springer
13 years 10 months ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
SPAA
2004
ACM
13 years 10 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
RSFDGRC
2005
Springer
13 years 10 months ago
2005
Springer
We discuss an ontological framework for approximation, i.e., to approximation of concepts and vague dependencies specified in a given ontology. The presented approach is based on ...
EUROCAST
2005
Springer
13 years 10 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
QEST
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract— Approximation techniques for labelled Markov processes on continuous state spaces were developed by Desharnais, Gupta, Jagadeesan and Panangaden. However, it has not be...
ICDCS
2006
IEEE
13 years 10 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...