Sciweavers

1253 search results - page 211 / 251
» Studying Software Evolution for Taming Software Complexity
Sort
View
BMCBI
2010
164views more  BMCBI 2010»
13 years 8 months ago
Flexible network reconstruction from relational databases with Cytoscape and CytoSQL
Background: Molecular interaction networks can be efficiently studied using network visualization software such as Cytoscape. The relevant nodes, edges and their attributes can be...
Kris Laukens, Jens Hollunder, Thanh Hai Dang, Geer...
BMCBI
2010
113views more  BMCBI 2010»
13 years 8 months ago
Probabilistic Principal Component Analysis for Metabolomic Data
Background: Data from metabolomic studies are typically complex and high-dimensional. Principal component analysis (PCA) is currently the most widely used statistical technique fo...
Gift Nyamundanda, Lorraine Brennan, Isobel Claire ...
VMCAI
2007
Springer
14 years 2 months ago
Lattice Automata
Abstract. Several verification methods involve reasoning about multi-valued systems, in which an atomic proposition is interpreted at a state as a lattice element, rather than a B...
Orna Kupferman, Yoad Lustig
FSTTCS
2010
Springer
13 years 6 months ago
One-Counter Stochastic Games
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
Tomás Brázdil, Václav Brozek,...
WEA
2010
Springer
545views Algorithms» more  WEA 2010»
14 years 3 months ago
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik...