909 search results - page 125 / 182 » Performance Evaluation of the VF Graph Matching Algorithm |
136
click to vote
BMCBI
2011
14 years 5 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
111
click to vote
JMLR
2010
14 years 8 months ago
2010
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
114
click to vote
IPSN
2009
Springer
15 years 8 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
112
click to vote
SAC
2004
ACM
15 years 6 months ago
2004
ACM
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
101
click to vote
LREC
2008
15 years 2 months ago
2008
A core ontology is a mid-level ontology which bridges the gap between an upper ontology and a domain ontology. Automatic Chinese core ontology construction can help quickly model ...