Sciweavers

450 search results - page 27 / 90
» The Complexity of Computing Minimal Unidirectional Covering ...
Sort
View
JMLR
2008
148views more  JMLR 2008»
14 years 11 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
GI
2003
Springer
15 years 5 months ago
An Integrated Approach to Survivability Analysis of Large Complex Critical Infrastructures
: The integrated approach for analysis of Large Complex Critical Infrastructures (LCCIs) to afford survivability aimed at preparing a Roadmap for Research and Development for criti...
Sandro Bologna, Thomas Beer
JSAC
2008
140views more  JSAC 2008»
14 years 11 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
TIFS
2010
120views more  TIFS 2010»
14 years 6 months ago
Quantitative Structural Steganalysis of Jsteg
Quantitative steganalysis strives to estimate the change rate defined as the relative number of embedding changes introduced by steganography. In this paper, we propose two new cla...
Jan Kodovský, Jessica J. Fridrich
ECCC
2006
107views more  ECCC 2006»
14 years 12 months ago
Energy Complexity and Entropy of Threshold Circuits
Abstract. Circuits composed of threshold gates (McCulloch-Pitts neurons, or perceptrons) are simplified models of neural circuits with the advantage that they are theoretically mor...
Wolfgang Maass, Kei Uchizawa, Rodney J. Douglas