Sciweavers

2060 search results - page 158 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
FOCM
2011
96views more  FOCM 2011»
14 years 1 months ago
Persistent Intersection Homology
The theory of intersection homology was developed to study the singularities of a topologically stratified space. This paper incorporates this theory into the already developed f...
Paul Bendich, John Harer
CCS
2008
ACM
14 years 12 months ago
Code injection attacks on harvard-architecture devices
Harvard architecture CPU design is common in the embedded world. Examples of Harvard-based architecture devices are the Mica family of wireless sensors. Mica motes have limited me...
Aurélien Francillon, Claude Castelluccia
APAL
2007
131views more  APAL 2007»
14 years 10 months ago
Bounded fixed-parameter tractability and reducibility
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
Rod Downey, Jörg Flum, Martin Grohe, Mark Wey...
ICASSP
2009
IEEE
15 years 4 months ago
Enhancement of reverberant speech using the CELP postfilter
In this paper we investigate the application of adaptive postfiltering for the enhancement of reverberant speech. The considered method is commonly used in Code Excited Linear Pr...
Marco Jeub, Peter Vary
FIDJI
2003
Springer
15 years 3 months ago
Seamless UML Support for Service-Based Software Architectures
The UML has become the de facto standard for the analysis and design of complex software. Tool support today includes the generation of code realizing the structural model describe...
Matthias Tichy, Holger Giese