Sciweavers

3273 search results - page 618 / 655
» types 2007
Sort
View
ASIACRYPT
2007
Springer
15 years 6 months ago
When e-th Roots Become Easier Than Factoring
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
Antoine Joux, David Naccache, Emmanuel Thomé...
ASIAN
2007
Springer
102views Algorithms» more  ASIAN 2007»
15 years 6 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...
ATAL
2007
Springer
15 years 6 months ago
On opportunistic techniques for solving decentralized Markov decision processes with temporal constraints
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
Janusz Marecki, Milind Tambe
ATAL
2007
Springer
15 years 6 months ago
Reasoning about judgment and preference aggregation
Agents that must reach agreements with other agents need to reason about how their preferences, judgments, and beliefs might be aggregated with those of others by the social choic...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
AUSDM
2007
Springer
173views Data Mining» more  AUSDM 2007»
15 years 6 months ago
The Use of Various Data Mining and Feature Selection Methods in the Analysis of a Population Survey Dataset
This paper reports the results of feature reduction in the analysis of a population based dataset for which there were no specific target variables. All attributes were assessed a...
Ellen Pitt, Richi Nayak