Sciweavers

3019 search results - page 258 / 604
» Approximating the Domatic Number
Sort
View
ICIP
1997
IEEE
16 years 8 months ago
An Efficient Boundary Encoding Scheme which is Optimal in the Rate-Distortion Sense
In this paper, we present a fast and optimal method for the lossy encoding of object boundaries which are given as 8-connect chain codes. We approximate the boundary by a polygon ...
Fabian W. Meier, Guido M. Schuster, Aggelos K. Kat...
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
16 years 7 months ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal
ICCSA
2010
Springer
16 years 2 months ago
String Matching with Mismatches by Real-Valued FFT
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
Kensuke Baba
STACS
2009
Springer
16 years 2 months ago
Semi-Online Preemptive Scheduling: One Algorithm for All Variants
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
Tomás Ebenlendr, Jiri Sgall
ICASSP
2008
IEEE
16 years 1 months ago
A factor graph approach to joint iterative data detection and channel estimation in pilot-assisted IDMA transmissions
We consider a pilot-assisted interleave-division multiple access (IDMA) system transmitting over block-fading channels. We describe this system in terms of a factor graph and use ...
Clemens Novak, Gerald Matz, Franz Hlawatsch