Sciweavers

409 search results - page 18 / 82
» Compact Similarity Joins
Sort
View
ISAMI
2010
13 years 5 months ago
Employing Compact Intra-genomic Language Models to Predict Genomic Sequences and Characterize Their Entropy
Probabilistic models of languages are fundamental to understand and learn the profile of the subjacent code in order to estimate its entropy, enabling the verification and predicti...
Sérgio A. D. Deusdado, Paulo Carvalho
ENTCS
2007
134views more  ENTCS 2007»
13 years 7 months ago
A Compact Linear Translation for Bounded Model Checking
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
Paul B. Jackson, Daniel Sheridan
AOSD
2007
ACM
13 years 11 months ago
Join point selectors
One of the main issues in modern aspect-oriented programming languages and frameworks is the expressiveness of the pointcut language or mechanism. The expressiveness of pointcut l...
Cristiano Breuel, Francisco Reverbel
AAAI
2006
13 years 9 months ago
A Compact Representation Scheme for Coalitional Games in Open Anonymous Environments
Coalition formation is an important capability of automated negotiation among self-interested agents. In order for coalitions to be stable, a key question that must be answered is...
Naoki Ohta, Atsushi Iwasaki, Makoto Yokoo, Kohki M...
PPOPP
2003
ACM
14 years 24 days ago
Compactly representing parallel program executions
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
Ankit Goel, Abhik Roychoudhury, Tulika Mitra