Sciweavers

928 search results - page 116 / 186
» The degree structure of Weihrauch-reducibility
Sort
View
75
Voted
ACL
1998
15 years 1 months ago
Eliminative Parsing with Graded Constraints
Abstract Resource adaptlvity" Because the sets of strucNatural language parsing is conceived to be a procedure of disambiguation, which successively reduces an initially total...
Johannes Heinecke, Jürgen Kunze, Wolfgang Men...
85
Voted
TCS
2002
15 years 5 days ago
Restriction categories I: categories of partial maps
Given a category with a stable system of monics, one can form the corresponding category of partial maps. To each map in this category there is, on the domain of the map, an assoc...
J. Robin B. Cockett, Stephen Lack
CORR
2007
Springer
155views Education» more  CORR 2007»
15 years 16 days ago
Low-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...
Martin J. Wainwright, Emin Martinian
FPCA
1995
15 years 4 months ago
How Much Non-Strictness do Lenient Programs Require?
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
Klaus E. Schauser, Seth Copen Goldstein
102
Voted
ESWS
2009
Springer
15 years 3 months ago
Hybrid Adaptive Web Service Selection with SAWSDL-MX and WSDL-Analyzer
Abstract. In this paper, we present an adaptive, hybrid semantic matchmaker for SAWSDL services, called SAWSDL-MX2. It determines three kinds of semantic service similarity with a ...
Matthias Klusch, Patrick Kapahnke, Ingo Zinnikus