Sciweavers

219 search results - page 12 / 44
» Combinatorial Complexity of Regular Languages
Sort
View
CORR
2008
Springer
112views Education» more  CORR 2008»
14 years 10 months ago
Analytic aspects of the shuffle product
There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the searc...
Marni Mishna, Mike Zabrocki
JUCS
2006
107views more  JUCS 2006»
14 years 10 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
EOR
2011
140views more  EOR 2011»
14 years 1 months ago
Compact bidding languages and supplier selection for markets with economies of scale and scope
Combinatorial auctions have been used in procurement markets with economies of scope. Preference elicitation is already a problem in single-unit combinatorial auctions, but it bec...
Martin Bichler, Stefan Schneider, Kemal Guler, Meh...
ALT
2006
Springer
15 years 7 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
CIE
2005
Springer
15 years 3 months ago
Some Reducibilities on Regular Sets
Abstract. We discuss some known and introduce some new reducibilities on regular sets. We establish some facts on the corresponding degree structures and relate some reducibilities...
Victor L. Selivanov