Sciweavers

440 search results - page 19 / 88
» On partial randomness
Sort
View
SIGPRO
2002
91views more  SIGPRO 2002»
14 years 11 months ago
Comparison of maximum entropy and minimal mutual information in a nonlinear setting
In blind source separation (BSS), two di erent separation techniques are mainly used: minimal mutual information (MMI), where minimization of the mutual output information yields ...
Fabian J. Theis, Christoph Bauer, Elmar Wolfgang L...
IROS
2008
IEEE
165views Robotics» more  IROS 2008»
15 years 6 months ago
Probabilistic navigation in dynamic environment using Rapidly-exploring Random Trees and Gaussian processes
— The paper describes a navigation algorithm for dynamic, uncertain environment. Moving obstacles are supposed to move on typical patterns which are pre-learned and are represent...
Chiara Fulgenzi, Christopher Tay, Anne Spalanzani,...
COLING
2008
15 years 1 months ago
Training Conditional Random Fields Using Incomplete Annotations
We address corpus building situations, where complete annotations to the whole corpus is time consuming and unrealistic. Thus, annotation is done only on crucial part of sentences...
Yuta Tsuboi, Hisashi Kashima, Shinsuke Mori, Hirok...
TPDS
1998
76views more  TPDS 1998»
14 years 11 months ago
Randomized Routing, Selection, and Sorting on the OTIS-Mesh
The Optical Transpose Interconnection System (OTIS) is a recently proposed model of computing that exploits the special features of both electronic and optical technologies. In th...
Sanguthevar Rajasekaran, Sartaj Sahni
FCS
2009
14 years 9 months ago
Spectral Analysis of Attractors in Random Boolean Network Models
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
Kenneth A. Hawick