Sciweavers

3145 search results - page 305 / 629
» Algebraic Linear Orderings
Sort
View
JSYML
2006
86views more  JSYML 2006»
15 years 6 months ago
Degrees of monotone complexity
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
William C. Calhoun
ACL
2009
15 years 4 months ago
Dependency Based Chinese Sentence Realization
This paper describes log-linear models for a general-purpose sentence realizer based on dependency structures. Unlike traditional realizers using grammar rules, our method realize...
Wei He, Haifeng Wang, Yuqing Guo, Ting Liu
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
16 years 20 days ago
On the sensitivity of BDDs with respect to path-related objective functions
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
Rüdiger Ebendt, Rolf Drechsler
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
15 years 11 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye
EUSFLAT
2001
15 years 8 months ago
Refining aggregation operations in finite ordinal scales
We discuss how to aggregate multiple criteria evaluations belonging to qualitative, linearly ordered scales. Qualitative aggregation operations such as min or max can be refined b...
Didier Dubois, Henri Prade