Sciweavers

1129 search results - page 55 / 226
» Modular Ranking Abstraction
Sort
View
LPAR
2005
Springer
14 years 3 months ago
Algebraic Intruder Deductions
Abstract. Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally anal...
David A. Basin, Sebastian Mödersheim, Luca Vi...
HICSS
2003
IEEE
110views Biometrics» more  HICSS 2003»
14 years 2 months ago
Phobos: A Front-End Approach to Extensible Compilers
Abstract. This paper describes a practical approach for implementing certain types of domain-specific languages with extensible compilers. Given a compiler with one or more front-...
Adam Granicz, Jason Hickey
GRAMMARS
2000
100views more  GRAMMARS 2000»
13 years 9 months ago
Tabulation of Automata for Tree-Adjoining Languages
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemon...
TACAS
2004
Springer
135views Algorithms» more  TACAS 2004»
14 years 3 months ago
Liveness with Incomprehensible Ranking
Abstract. The methods of Invisible Invariants and Invisible Ranking were developed originally in order to verify temporal properties of parameterized systems in a fully automatic m...
Yi Fang, Nir Piterman, Amir Pnueli, Lenore D. Zuck
ECIR
2006
Springer
13 years 11 months ago
Probabilistic Score Normalization for Rank Aggregation
Abstract. Rank aggregation is a pervading operation in IR technology. We hypothesize that the performance of score-based aggregation may be affected by artificial, usually meaningl...
Miriam Fernández, David Vallet, Pablo Caste...