Sciweavers

264 search results - page 10 / 53
» Learning Linearly Separable Languages
Sort
View
IJON
1998
172views more  IJON 1998»
13 years 8 months ago
Blind separation of convolved mixtures in the frequency domain
In this paper we employ information theoretic algorithms, previously used for separating instantaneous mixtures of sources, for separating convolved mixtures in the frequency doma...
Paris Smaragdis
APLAS
2004
ACM
14 years 2 months ago
A Functional Language for Logarithmic Space
Abstract. More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas efficiently. The design choices however eï...
Peter Møller Neergaard
ICALP
2007
Springer
14 years 2 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
COGSCI
2006
62views more  COGSCI 2006»
13 years 8 months ago
Idiomatic Syntactic Constructions and Language Learning
This article explores the influence of idiomatic syntactic constructions (i.e., constructions whose phrase structure rules violate the rules that underlie the construction of othe...
Michael P. Kaschak, Jenny R. Saffran
RC
2002
100views more  RC 2002»
13 years 8 months ago
Efficient Interval Linear Equality Solving in Constraint Logic Programming
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constrai...
Chong-Kan Chiu, Jimmy Ho-Man Lee