Sciweavers

308 search results - page 45 / 62
» Efficient Software Model Checking of Data Structure Properti...
Sort
View
LWA
2004
14 years 11 months ago
Dirichlet Enhanced Latent Semantic Analysis
This paper describes nonparametric Bayesian treatments for analyzing records containing occurrences of items. The introduced model retains the strength of previous approaches that...
Kai Yu, Shipeng Yu, Volker Tresp
ENTCS
2007
121views more  ENTCS 2007»
14 years 9 months ago
Incremental Parametric Development of Greedy Algorithms
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
Dominique Cansell, Dominique Méry
BMCBI
2010
232views more  BMCBI 2010»
14 years 9 months ago
LucidDraw: Efficiently visualizing complex biochemical networks within MATLAB
Background: Biochemical networks play an essential role in systems biology. Rapidly growing network data and e research activities call for convenient visualization tools to aid i...
Sheng He, Juan Mei, Guiyang Shi, Zhengxiang Wang, ...
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
15 years 11 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
BMCBI
2010
178views more  BMCBI 2010»
14 years 9 months ago
Applications of a formal approach to decipher discrete genetic networks
Background: A growing demand for tools to assist the building and analysis of biological networks exists in systems biology. We argue that the use of a formal approach is relevant...
Fabien Corblin, Eric Fanchon, Laurent Trilling