Sciweavers

1146 search results - page 96 / 230
» Finite cupping sets
Sort
View
CORR
1998
Springer
107views Education» more  CORR 1998»
13 years 9 months ago
Computing Declarative Prosodic Morphology
This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a re...
Markus Walther
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 9 months ago
Bipolarization of posets and natural interpolation
The Choquet integral w.r.t. a capacity can be seen in the finite case as a parsimonious linear interpolator between vertices of [0, 1]n. We take this basic fact as a starting poin...
Michel Grabisch, Christophe Labreuche
ANCS
2009
ACM
13 years 8 months ago
A NFA-based programmable regular expression match engine
Pattern matching is the most computation intensive task of a network intrusion detection system (NIDS). In this paper we present a hardware architecture to speed up the pattern mat...
Derek Pao
ICASSP
2011
IEEE
13 years 1 months ago
Computing room acoustics with CUDA - 3D FDTD schemes with boundary losses and viscosity
In seeking to model realistic room acoustics, direct numerical simulation can be employed. This paper presents 3D Finite Difference Time Domain schemes that incorporate losses at ...
Craig J. Webb, Stefan Bilbao
CORR
1999
Springer
104views Education» more  CORR 1999»
13 years 9 months ago
A Bootstrap Approach to Automatically Generating Lexical Transfer Rules
We describe a method for automatically generating Lexical Transfer Rules (LTRs) from word equivalences using transfer rule templates. Templates are skeletal LTRs, unspecified for ...
Davide Turcato, Paul McFetridge, Fred Popowich, Ja...