Sciweavers

2210 search results - page 195 / 442
» Information complexity of neural networks
Sort
View
JSAC
2008
140views more  JSAC 2008»
15 years 6 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
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
16 years 1 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
UMUAI
2010
136views more  UMUAI 2010»
15 years 5 months ago
Towards affective camera control in games
Information about interactive virtual environments, such as games, is perceived by users through a virtual camera. While most interactive applications let users control the camera,...
Georgios N. Yannakakis, Héctor Perez Mart&i...
ICANN
2005
Springer
16 years 3 days ago
Fast Color-Based Object Recognition Independent of Position and Orientation
Small mobile robots typically have little on-board processing power for time-consuming vision algorithms. Here we show how they can quickly extract very dense yet highly useful inf...
Martijn van de Giessen, Jürgen Schmidhuber
ICANN
2005
Springer
16 years 3 days ago
f-SWRL: A Fuzzy Extension of SWRL
Although the combination of OWL and Horn rules results in the creation of a highly expressive language, i.e. SWRL, there are still many occasions where this language fails to accur...
Jeff Z. Pan, Giorgos B. Stamou, Vassilis Tzouvaras...