Sciweavers

866 search results - page 72 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
121
Voted
IPPS
1998
IEEE
15 years 7 months ago
Meta-heuristics for Circuit Partitioning in Parallel Test Generation
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...
Consolación Gil, Julio Ortega, Antonio F. D...
110
Voted
ESA
2005
Springer
162views Algorithms» more  ESA 2005»
15 years 8 months ago
Negative Cycle Detection Problem
In this paper, we will describe some heuristics that can be used to improve the runtime of a wide range of commonly used algorithms for the negative cycle detection problem signi...
Chi-Him Wong, Yiu-Cheong Tam
132
Voted
MOBIHOC
2004
ACM
16 years 2 months ago
Localized algorithms for energy efficient topology in wireless ad hoc networks
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
Wen-Zhan Song, Yu Wang 0003, Xiang-Yang Li
124
Voted
JMLR
2008
94views more  JMLR 2008»
15 years 2 months ago
Using Markov Blankets for Causal Structure Learning
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
Jean-Philippe Pellet, André Elisseeff
121
Voted
SAC
2009
ACM
15 years 9 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad