2228 search results - page 401 / 446 » Distributed Data Clustering Can Be Efficient and Exact |
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
SIGMOD
2010
ACM
13 years 7 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
PERCOM
2006
ACM
14 years 3 months ago
2006
ACM
As mobile ad hoc networks (MANETs) become ever more popular, it also becomes more and more interesting to build distributed network applications (e.g. data storage, etc.) that hav...
ESWS
2008
Springer
13 years 10 months ago
2008
Springer
In order to overcome the limitations of deductive logic-based approaches to deriving operational knowledge from ontologies, especially when data come from distributed sources, indu...