Sciweavers

11862 search results - page 28 / 2373
» Relative information completeness
Sort
View
DAM
2008
109views more  DAM 2008»
13 years 7 months ago
Minimal comparability completions of arbitrary graphs
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
Pinar Heggernes, Federico Mancini, Charis Papadopo...
COMBINATORICS
2006
133views more  COMBINATORICS 2006»
13 years 7 months ago
Completion of the Wilf-Classification of 3-5 Pairs Using Generating Trees
A permutation is said to avoid the permutation if no subsequence in has the same order relations as . Two sets of permutations 1 and 2 are Wilfequivalent if, for all n, the numb...
Mark Lipson
EUSFLAT
2003
146views Fuzzy Logic» more  EUSFLAT 2003»
13 years 9 months ago
Cut equivalence of fuzzy relations
Fuzzy relations on the same domain are classified according to the equality of families of cut sets. This equality of fuzzy relations is completely characterized, not only for un...
Branimir Seselja, Andreja Tepavcevic
ALPIT
2008
IEEE
14 years 2 months ago
Tree Kernel-Based Semantic Relation Extraction Using Unified Dynamic Relation Tree
This paper proposes a Unified Dynamic Relation Tree (DRT) span for tree kernel-based semantic relation extraction between entity names. The basic idea is to apply a variety of lin...
Longhua Qian, Guodong Zhou, Fang Kong, Qiaoming Zh...
DCOSS
2006
Springer
13 years 11 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama