Sciweavers

520 search results - page 49 / 104
» Computing recombination networks from binary sequences
Sort
View
APAL
2010
85views more  APAL 2010»
14 years 10 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
BMCBI
2008
160views more  BMCBI 2008»
14 years 10 months ago
Predicting cancer involvement of genes from heterogeneous data
Background: Systematic approaches for identifying proteins involved in different types of cancer are needed. Experimental techniques such as microarrays are being used to characte...
Ramon Aragues, Chris Sander, Baldo Oliva
ICPR
2006
IEEE
15 years 11 months ago
A Novel Human Gait Recognition Method by Segmenting and Extracting the Region Variance Feature
Existing methods of gait recognition suffer from some shortcomings, which are discussed at the beginning of the full paper. In order to suppress these shortcomings as much as poss...
Yanmei Chai, Qing Wang, Jingping Jia, Rongchun Zha...
INTETAIN
2005
Springer
15 years 3 months ago
Grounding Emotions in Human-Machine Conversational Systems
In this paper we investigate the role of user emotions in human-machine goal-oriented conversations. There has been a growing interest in predicting emotions from acted and non-act...
Giuseppe Riccardi, Dilek Z. Hakkani-Tür
WINET
2010
128views more  WINET 2010»
14 years 8 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...