2638 search results - page 289 / 528 » Random Geometric Complexes |
270
click to vote
RECOMB
2012
Springer
13 years 9 months ago
2012
Springer
Background: Paralog reduction, the loss of duplicate genes after whole genome duplication (WGD) is a pervasive process. Whether this loss proceeds gene by gene or through deletion...
165
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP do...
188
click to vote
ACAL
2009
Springer
16 years 1 months ago
2009
Springer
The Information Fusion Panel within The Technical Cooperation Program (TTCP) is developing algorithms to perform machine-based situation assessment to assist human operators in co...
146
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper presents a new updating algorithm to reduce the complexity of computing an observability index for kinematic calibration of robots. An active calibration algorithm i...
130
click to vote
ISCAS
2006
IEEE
16 years 18 days ago
2006
IEEE
— In this paper, we describe a simple second-order discrete-time model for the Transmission Control Protocol (TCP) with Random Early Detection (RED) algorithm. The TCP/RED mechan...