Sciweavers

1208 search results - page 155 / 242
» On Counting Generalized Colorings
Sort
View
137
Voted
AMW
2009
15 years 4 months ago
Temporal Support in Sequential Pattern Mining
In sequential pattern discovery, the support of a sequence is computed as the number of data-sequences satisfying a pattern with respect to the total number of data-sequences in th...
Leticia I. Gómez, Bart Kuijpers, Alejandro ...
118
Voted
DOCENG
2010
ACM
15 years 4 months ago
Glyph extraction from historic document images
This paper is about the reproduction of ancient texts with vectorised fonts. While for OCR only recognition rates count, a reproduction process does not necessarily require the re...
Lothar Meyer-Lerbs, Arne Schuldt, Björn Gottf...
DATAMINE
2010
133views more  DATAMINE 2010»
15 years 3 months ago
Using background knowledge to rank itemsets
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...
Nikolaj Tatti, Michael Mampaey
138
Voted
CORR
2006
Springer
144views Education» more  CORR 2006»
15 years 3 months ago
On the logical definability of certain graph and poset languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
Pascal Weil
100
Voted
CCR
2007
76views more  CCR 2007»
15 years 3 months ago
Reducing the TCP acknowledgment frequency
Delayed acknowledgments were introduced to conserve network and host resources. Further reduction of the acknowledgment frequency can be motivated in the same way. However, reduci...
Sara Landström, Lars-Åke Larzon