Sciweavers

115 search results - page 22 / 23
» Constraints and Application Conditions: From Graphs to High-...
Sort
View
ICCS
2007
Springer
14 years 1 months ago
Characterizing Implications of Injective Partial Orders
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
José L. Balcázar, Gemma C. Garriga
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
14 years 25 days ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...
INFOCOM
2008
IEEE
14 years 1 months ago
Area Avoidance Routing in Distance-Vector Networks
Network routing may be required, under certain applications, to avoid certain areas (or nodes) These areas can be of potential security threat, possess poor quality or have other ...
Haim Zlatokrilov, Hanoch Levy
AMAI
2004
Springer
14 years 27 days ago
Using the Central Limit Theorem for Belief Network Learning
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
Ian Davidson, Minoo Aminian
BMCBI
2004
142views more  BMCBI 2004»
13 years 7 months ago
GOTree Machine (GOTM): a web-based platform for interpreting sets of interesting genes using Gene Ontology hierarchies
Background: Microarray and other high-throughput technologies are producing large sets of interesting genes that are difficult to analyze directly. Bioinformatics tools are needed...
Bing Zhang, Denise Schmoyer, Stefan Kirov, Jay Sno...