Sciweavers

2835 search results - page 501 / 567
» Automatic Question Answering
Sort
View
CTRSA
2007
Springer
146views Cryptology» more  CTRSA 2007»
16 years 11 days ago
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
DAWAK
2007
Springer
16 years 11 days ago
Mining Top-K Multidimensional Gradients
Several business applications such as marketing basket analysis, clickstream analysis, fraud detection and churning migration analysis demand gradient data analysis. By employing g...
Ronnie Alves, Orlando Belo, Joel Ribeiro
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
16 years 10 days ago
Screening the parameters affecting heuristic performance
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
Enda Ridge, Daniel Kudenko
ISW
2007
Springer
16 years 10 days ago
Detecting System Emulators
Malware analysis is the process of determining the behavior and purpose of a given malware sample (such as a virus, worm, or Trojan horse). This process is a necessary step to be a...
Thomas Raffetseder, Christopher Krügel, Engin...
SAT
2007
Springer
118views Hardware» more  SAT 2007»
16 years 9 days ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov