Sciweavers

2950 search results - page 214 / 590
» Computing with Infinitely Many Processes
Sort
View
ICIP
1998
IEEE
16 years 8 months ago
Efficient Representation and Decoding of Static Huffman Code Tables in a Very Low Bit Rate Environment
The lossless entropy coding used in many image coding schemes often is overlooked as most research is based around the lossy stages of image compression. This paper examines the r...
Nick B. Body, Donald G. Bailey
EACL
2009
ACL Anthology
16 years 7 months ago
Cube Summing, Approximate Inference with Non-Local Features, and Dynamic Programming without Semirings
We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
Kevin Gimpel, Noah A. Smith
EACL
2009
ACL Anthology
16 years 7 months ago
Using Lexical and Relational Similarity to Classify Semantic Relations
Many methods are available for computing semantic similarity between individual words, but certain NLP tasks require the comparison of word pairs. This paper presents a kernel-bas...
Ann A. Copestake, Diarmuid Ó Séaghdh...
ECIR
2009
Springer
16 years 3 months ago
Topic and Trend Detection in Text Collections Using Latent Dirichlet Allocation
Algorithms that enable the process of automatically mining distinct topics in document collections have become increasingly important due to their applications in many fields and ...
Levent Bolelli, Seyda Ertekin, C. Lee Giles
ASM
2010
ASM
16 years 1 months ago
Alloy+HotCore: A Fast Approximation to Unsat Core
Identifying a minimal unsatisfiable core in an Alloy model proved to be a very useful feature in many scenarios. We extend this concept to hot core, an approximation to unsat core...
Nicolás D'Ippolito, Marcelo F. Frias, Juan ...