Sciweavers

17049 search results - page 3300 / 3410
» cans 2007
Sort
View
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
15 years 4 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
84
Voted
ASIACRYPT
2007
Springer
15 years 4 months ago
Bounded CCA2-Secure Encryption
Abstract. Whereas encryption schemes withstanding passive chosenplaintext attacks (CPA) can be constructed based on a variety of computational assumptions, only a few assumptions a...
Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, ...
81
Voted
ASIAN
2007
Springer
102views Algorithms» more  ASIAN 2007»
15 years 4 months ago
A Static Birthmark of Binary Executables Based on API Call Structure
Abstract. A software birthmark is a unique characteristic of a program that can be used as a software theft detection. In this paper we suggest and empirically evaluate a static bi...
Seokwoo Choi, Heewan Park, Hyun-il Lim, Taisook Ha...
79
Voted
ATAL
2007
Springer
15 years 4 months ago
Extending character-based storytelling with awareness and feelings
Most Interactive Storytelling systems developed to date have followed a task-based approach to story representation, using planning techniques to drive the story by generating a s...
David Pizzi, Marc Cavazza, Jean-Luc Lugrin
107
Voted
ATAL
2007
Springer
15 years 4 months ago
Aborting tasks in BDI agents
Intelligent agents that are intended to work in dynamic environments must be able to gracefully handle unsuccessful tasks and plans. In addition, such agents should be able to mak...
John Thangarajah, James Harland, David N. Morley, ...
« Prev « First page 3300 / 3410 Last » Next »