1322 search results - page 222 / 265 » Parameterized counting problems |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
DATAMINE
2010
13 years 10 months ago
2010
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
FGCS
2008
13 years 10 months ago
2008
As distributed storage systems grow, the response time between detection and repair of the error becomes significant. Systems built on shared servers have additional complexity be...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
: This communication describes a representation of images as a set of edges characterized by their position and orientation. This representation allows the comparison of two images...
DATAMINE
2006
13 years 10 months ago
2006
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...