Sciweavers

258 search results - page 6 / 52
» Relational Correspondences for Lattices with Operators
Sort
View
AML
2006
83views more  AML 2006»
13 years 7 months ago
The Medvedev lattice of computably closed sets
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
Sebastiaan Terwijn
ISCI
2002
106views more  ISCI 2002»
13 years 7 months ago
Neighborhood operator systems and approximations
This paper presents a framework for the study of generalizing the standard notion of equivalence relation in rough set approximation space with various categories of k-step neighb...
Wei-Zhi Wu, Wen-Xiu Zhang
EJC
2007
13 years 7 months ago
On some enumerative aspects of generalized associahedra
We prove a conjecture of F. Chapoton relating certain enumerative invariants of (a) the cluster complex associated by S. Fomin and A. Zelevinsky with a finite root system and (b)...
Christos A. Athanasiadis
IPM
2007
86views more  IPM 2007»
13 years 7 months ago
Document concept lattice for text understanding and summarization
We argue that the quality of a summary can be evaluated based on how many concepts in the original document(s) that reserved after summarization. Here, a concept refers to an abst...
Shiren Ye, Tat-Seng Chua, Min-Yen Kan, Long Qiu
EMNLP
2010
13 years 5 months ago
Facilitating Translation Using Source Language Paraphrase Lattices
For resource-limited language pairs, coverage of the test set by the parallel corpus is an important factor that affects translation quality in two respects: 1) out of vocabulary ...
Jinhua Du, Jie Jiang, Andy Way