Sciweavers

900 search results - page 61 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
DCG
2010
137views more  DCG 2010»
13 years 9 months ago
Improved Results on Geometric Hitting Set Problems
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
ICASSP
2007
IEEE
14 years 3 months ago
Toward Turbo Decoding of RNA Secondary Structure
We propose an iterative probabilistic algorithm for estimation of RNA secondary structure using sequence data from two homologous sequences. The method is intended to exploit inte...
Arif Ozgun Harmanci, Gaurav Sharma, David H. Mathe...
CHI
2009
ACM
14 years 9 months ago
What's in Wikipedia?: mapping topics and conflict using socially annotated category structure
Wikipedia is an online encyclopedia which has undergone tremendous growth. However, this same growth has made it difficult to characterize its content and coverage. In this paper ...
Aniket Kittur, Ed H. Chi, Bongwon Suh
TIT
2008
110views more  TIT 2008»
13 years 8 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra
CONCUR
2006
Springer
13 years 10 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink