Sciweavers

419 search results - page 77 / 84
» Constraint models for graceful graphs
Sort
View
UAI
2003
13 years 8 months ago
Learning Continuous Time Bayesian Networks
Continuous time Bayesian networks (CTBN) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cycli...
Uri Nodelman, Christian R. Shelton, Daphne Koller
GLOBECOM
2008
IEEE
13 years 6 months ago
Power Efficient Throughput Maximization in Multi-Hop Wireless Networks
Abstract-- We study the problem of total throughput maximization in arbitrary multi-hop wireless networks, with constraints on the total power usage (denoted by PETM), when nodes h...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
RAS
2007
113views more  RAS 2007»
13 years 6 months ago
From images to rooms
In this paper we start from a set of images obtained by the robot that is moving around in an environment. We present a method to automatically group the images into groups that c...
Zoran Zivkovic, Olaf Booij, Ben J. A. Kröse
CISC
2009
Springer
148views Cryptology» more  CISC 2009»
13 years 4 months ago
Using Strategy Objectives for Network Security Analysis
The anticipation game framework is an extension of attack graphs based on game theory. It is used to anticipate and analyze intruder and administrator concurrent interactions with ...
Elie Bursztein, John C. Mitchell
ICASSP
2011
IEEE
12 years 10 months ago
Spatially-correlated sensor discriminant analysis
A study of generalization error in signal detection by multiple spatially-distributed and -correlated sensors is provided when the detection rule is learned from a finite number ...
Kush R. Varshney