Sciweavers

10891 search results - page 199 / 2179
» Combining Model Reductions
Sort
View
ASIACRYPT
2010
Springer
15 years 1 months ago
Random Oracles with(out) Programmability
This paper investigates the Random Oracle Model (ROM) feature known as programmability, which allows security reductions in the ROM to dynamically choose the range points of an ide...
Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Th...
122
Voted
IWINAC
2007
Springer
15 years 9 months ago
Optimal Cue Combination for Saliency Computation: A Comparison with Human Vision
The computer model of visual attention derives an interest or saliency map from an input image in a process that encompasses several data combination steps. While several combinati...
Alexandre Bur, Heinz Hügli
EMNLP
2007
15 years 5 months ago
Detecting Compositionality of Verb-Object Combinations using Selectional Preferences
In this paper we explore the use of selectional preferences for detecting noncompositional verb-object combinations. To characterise the arguments in a given grammatical relations...
Diana McCarthy, Sriram Venkatapathy, Aravind K. Jo...
117
Voted
ACL
1998
15 years 4 months ago
Improving Data Driven Wordclass Tagging by System Combination
In this paper we examine how the differences in modelling between different data driven systems performing the same NLP task can be exploited to yield a higher accuracy than the b...
Hans van Halteren, Jakub Zavrel, Walter Daelemans
96
Voted
ICCAD
2005
IEEE
90views Hardware» more  ICCAD 2005»
16 years 13 days ago
Scalable compositional minimization via static analysis
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
Fadi A. Zaraket, Jason Baumgartner, Adnan Aziz