Sciweavers

1240 search results - page 185 / 248
» Applying Memetic Algorithms to the Analysis of Microarray Da...
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
15 years 10 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
BMCBI
2010
150views more  BMCBI 2010»
14 years 10 months ago
Systematic calibration of a cell signaling network model
Background: Mathematical modeling is being applied to increasingly complex biological systems and datasets; however, the process of analyzing and calibrating against experimental ...
Kyoung Ae Kim, Sabrina L. Spencer, John G. Albeck,...
ICNP
2002
IEEE
15 years 2 months ago
An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
Dahai Xu, Chunming Qiao, Yizhi Xiong
CAIP
2005
Springer
133views Image Analysis» more  CAIP 2005»
15 years 3 months ago
Finding the Number of Clusters for Nonparametric Segmentation
Non-parametric data representation can be done by means of a potential function. This paper introduces a methodology for finding modes of the potential function. Two different me...
Nikolaos Nasios, Adrian G. Bors
TCOM
2008
67views more  TCOM 2008»
14 years 9 months ago
Robust Frequency Hopping for Interference and Fading Channels
Abstract--A robust frequency-hopping system with noncoherent detection, iterative turbo decoding and demodulation, and channel estimation is presented. The data modulation is the s...
Don J. Torrieri, Shi Cheng, Matthew C. Valenti