Sciweavers

190 search results - page 36 / 38
» A Simple Proof Technique for Certain Parametricity Results
Sort
View
FSTTCS
2006
Springer
13 years 9 months ago
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
Sushmita Gupta, Venkatesh Raman, Saket Saurabh
ENTCS
2007
134views more  ENTCS 2007»
13 years 5 months ago
Improving the Decompilation of Java Bytecode to Prolog by Partial Evaluation
The interpretative approach to compilation allows compiling programs by partially evaluating an interpreter w.r.t. a source program. This approach, though very attractive in princ...
Miguel Gómez-Zamalloa, Elvira Albert, Germ&...
IPL
2010
98views more  IPL 2010»
13 years 4 months ago
Distinguishing attacks on stream ciphers based on arrays of pseudo-random words
In numerous modern stream ciphers, the internal state consists of a large array of pseudo-random words, and the output key-stream is a relatively simple function of the state. In ...
Nathan Keller, Stephen D. Miller
UAIS
2010
13 years 15 days ago
Auditory universal accessibility of data tables using naturally derived prosody specification
Abstract Text documents usually embody visually oriented meta-information in the form of complex visual structures, such as tables. The semantics involved in such objects result in...
Dimitris Spiliotopoulos, Gerasimos Xydas, Georgios...
ACL
1997
13 years 7 months ago
Towards Resolution of Bridging Descriptions
We present preliminary results concerning robust techniques for resolving bridging definite descriptions. We report our analysis of a collection of 20 Wall Street Journal articles...
Renata Vieira, Simone Teufel