Sciweavers

762 search results - page 19 / 153
» Conditionally correct superoptimization
Sort
View
AGP
1997
IEEE
14 years 2 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
ACL
1998
13 years 11 months ago
Conditions on Consistency of Probabilistic Tree Adjoining Grammars
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
Anoop Sarkar
AMFG
2003
IEEE
203views Biometrics» more  AMFG 2003»
14 years 3 months ago
Illumination Normalization for Robust Face Recognition Against Varying Lighting Conditions
Evaluations of the state-of-the-art of both academic face recognition algorithms and commercial systems have shown that recognition performance of most current technologies degrad...
Shiguang Shan, Wen Gao, Bo Cao, Debin Zhao
TDSC
2008
83views more  TDSC 2008»
13 years 10 months ago
A Precise Termination Condition of the Probabilistic Packet Marking Algorithm
The probabilistic packet marking (PPM) algorithm is a promising way to discover the Internet map or an attack graph that the attack packets traversed during a distributed denial-of...
T. Y. Wong, Man Hon Wong, John C. S. Lui
ECCV
2006
Springer
15 years 1 days ago
An Intensity Similarity Measure in Low-Light Conditions
In low-light conditions, it is known that Poisson noise and quantization noise become dominant sources of noise. While intensity difference is usually measured by Euclidean distanc...
François Alter, Yasuyuki Matsushita, Xiaoou...