Sciweavers

562 search results - page 68 / 113
» Dependency Pairs Revisited
Sort
View
SMC
2010
IEEE
158views Control Systems» more  SMC 2010»
14 years 9 months ago
A study of genetic algorithms for approximating the longest path in generic graphs
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
David Portugal, Carlos Henggeler Antunes, Rui Roch...
ACL
2009
14 years 9 months ago
Paraphrase Identification as Probabilistic Quasi-Synchronous Recognition
We present a novel approach to deciding whether two sentences hold a paraphrase relationship. We employ a generative model that generates a paraphrase of a given sentence, and we ...
Dipanjan Das, Noah A. Smith
EMNLP
2009
14 years 9 months ago
Learning Term-weighting Functions for Similarity Measures
Measuring the similarity between two texts is a fundamental problem in many NLP and IR applications. Among the existing approaches, the cosine measure of the term vectors represen...
Wen-tau Yih
ICIP
2009
IEEE
14 years 9 months ago
Web cartoon video hallucination
This paper addresses the super-resolution problem for low quality cartoon videos widely distributed on the web, which are generated by downsampling and compression from the source...
Zhiwei Xiong, Xiaoyan Sun, Feng Wu
ICTAI
2009
IEEE
14 years 9 months ago
Merging Qualitative Constraint Networks in a Piecewise Fashion
We address the problem of merging qualitative constraints networks (QCNs). We point out a merging algorithm which computes a consistent QCN representing a global view of the input...
Jean-François Condotta, Souhila Kaci, Pierr...