42230 search results - page 76 / 8446 » Algorithms and Complexity Results for |
ICDCIT
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a n...
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper, we propose a low-complexity iterative joint channel estimation, detection and decoding technique for doubly selective channels. The key is a segment-by-segment f...
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
ISSAC
2005
Springer
15 years 3 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
OTM
2005
Springer
15 years 3 months ago
2005
Springer
There are many problems requiring a semantic account of a database schema. At its best, such an account consists of mapping formulas between the schema and a formal conceptual mode...