Sciweavers

7785 search results - page 1545 / 1557
» The Concept of Dynamic Analysis
Sort
View
TCS
2008
15 years 1 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
BIOINFORMATICS
2005
152views more  BIOINFORMATICS 2005»
15 years 1 months ago
Intervention in context-sensitive probabilistic Boolean networks
Motivation: Intervention in a gene regulatory network is used to help it avoid undesirable states, such as those associated with a disease. Several types of intervention have been...
Ranadip Pal, Aniruddha Datta, Michael L. Bittner, ...
TISSEC
2008
235views more  TISSEC 2008»
15 years 1 months ago
SDAP: A Secure Hop-by-Hop Data Aggregation Protocol for Sensor Networks
Hop-by-hop data aggregation is a very important technique for reducing the communication overhead and energy expenditure of sensor nodes during the process of data collection in a...
Yi Yang, Xinran Wang, Sencun Zhu, Guohong Cao
TVCG
2008
147views more  TVCG 2008»
15 years 1 months ago
Cerebral: Visualizing Multiple Experimental Conditions on a Graph with Biological Context
Systems biologists use interaction graphs to model the behavior of biological systems at the molecular level. In an iterative process, such biologists observe the reactions of livi...
Aaron Barsky, Tamara Munzner, Jennifer L. Gardy, R...
JUCS
2007
90views more  JUCS 2007»
15 years 1 months ago
High-level Structured Interactive Programs with Registers and Voices
Abstract: A model (consisting of rv-systems), a core programming language (for developing rv-programs), several specification and analysis techniques appropriate for modeling, pro...
Alexandru Popa, Alexandru Sofronia, Gheorghe Stefa...
« Prev « First page 1545 / 1557 Last » Next »