Sciweavers

2489 search results - page 288 / 498
» On the Subgroup Distance Problem
Sort
View
IS
2008
15 years 4 months ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
IJRR
2007
75views more  IJRR 2007»
15 years 4 months ago
Surveillance Strategies for a Pursuer with Finite Sensor Range
This paper addresses the pursuit-evasion problem of maintaining surveillance by a pursuer of an evader in a world populated by polygonal obstacles. This requires the pursuer to pl...
Rafael Murrieta-Cid, Teja Muppirala, Alejandro Sar...
CORR
2008
Springer
117views Education» more  CORR 2008»
15 years 3 months ago
Complexity of Decoding Positive-Rate Reed-Solomon Codes
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
Qi Cheng, Daqing Wan
SPIRE
2010
Springer
15 years 2 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
99
Voted
CORR
2010
Springer
75views Education» more  CORR 2010»
15 years 2 months ago
Dense Error-Correcting Codes in the Lee Metric
Several new applications and a number of new mathematical techniques have increased the research on errorcorrecting codes in the Lee metric in the last decade. In this work we cons...
Tuvi Etzion, Alexander Vardy, Eitan Yaakobi