Sciweavers

1964 search results - page 125 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
Maximizing the Lifetime of Dominating Sets
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
Thomas Moscibroda, Roger Wattenhofer
ITSL
2008
13 years 9 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki
NIPS
1994
13 years 9 months ago
Factorial Learning and the EM Algorithm
Many real world learning problems are best characterized by an interaction of multiple independent causes or factors. Discovering such causal structure from the data is the focus ...
Zoubin Ghahramani
ICML
2000
IEEE
14 years 8 months ago
Discovering Homogeneous Regions in Spatial Data through Competition
If all features causing heterogeneity were observed, a mixture of experts approach (Jacobs et al., 1991) is likely to be superior to using a single model. When unobserved or very n...
Slobodan Vucetic, Zoran Obradovic
SUM
2010
Springer
13 years 6 months ago
Cost-Based Query Answering in Action Probabilistic Logic Programs
Abstract. Action-probabilistic logic programs (ap-programs), a class of probabilistic logic programs, have been applied during the last few years for modeling behaviors of entities...
Gerardo I. Simari, John P. Dickerson, V. S. Subrah...