Sciweavers

4894 search results - page 137 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
IWPC
2009
IEEE
16 years 1 months ago
Impact analysis and visualization toolkit for static crosscutting in AspectJ
Understanding aspect-oriented systems, without appropriate tool support, is a difficult and a recognized problem in the research community. Surprisingly, little has been done to ...
Dehua Zhang, Ekwa Duala-Ekoko, Laurie J. Hendren
ICASSP
2008
IEEE
16 years 26 days ago
Blind channel shortening in OFDM system using nulltones and cyclic prefix
This paper considers the problem of blind channel shortening in OFDM systems. Standard OFDM systems use guard interval (GI) in form of cyclic prefix (CP) and nulltones (NT) redun...
Taoufik Ben Jabeur, Karim Abed-Meraim, Hatem Bouje...
SP
2008
IEEE
16 years 24 days ago
Preventing Memory Error Exploits with WIT
Attacks often exploit memory errors to gain control over the execution of vulnerable programs. These attacks remain a serious problem despite previous research on techniques to pr...
Periklis Akritidis, Cristian Cadar, Costin Raiciu,...
SP
2008
IEEE
103views Security Privacy» more  SP 2008»
16 years 24 days ago
Preserving Caller Anonymity in Voice-over-IP Networks
— Applications such as VoIP need to provide anonymity to clients while maintaining low latency to satisfy quality of service (QoS) requirements. Existing solutions for providing ...
Mudhakar Srivatsa, Ling Liu, Arun Iyengar
CONCUR
2006
Springer
15 years 8 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson