Sciweavers

212 search results - page 23 / 43
» Complexity Parameters for First-Order Classes
Sort
View
WS
2006
ACM
14 years 1 months ago
Modeling Ad-hoc rushing attack in a negligibility-based security framework
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...
Jiejun Kong, Xiaoyan Hong, Mario Gerla
CATA
2004
13 years 8 months ago
Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
Fred J. Rispoli, Steven Cosares
AAAI
2010
13 years 8 months ago
Bayesian Policy Search for Multi-Agent Role Discovery
Bayesian inference is an appealing approach for leveraging prior knowledge in reinforcement learning (RL). In this paper we describe an algorithm for discovering different classes...
Aaron Wilson, Alan Fern, Prasad Tadepalli
CIKM
2004
Springer
14 years 22 days ago
A design space approach to analysis of information retrieval adaptive filtering systems
In this paper we suggest a new approach to analysis and design of IR systems. We argue for design space exploration in constructing IR systems and in analyzing the effects of ind...
Dmitriy Fradkin, Paul B. Kantor
CIARP
2006
Springer
13 years 11 months ago
A New Approach to Multi-class Linear Dimensionality Reduction
Linear dimensionality reduction (LDR) is quite important in pattern recognition due to its efficiency and low computational complexity. In this paper, we extend the two-class Chern...
Luis Rueda, Myriam Herrera