4302 search results - page 209 / 861 » Index Pairs Algorithms |
202
Voted
ICDE
2004
IEEE
16 years 2 months ago
2004
IEEE
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
102
Voted
FITRAMEN
2008
15 years 2 months ago
2008
The current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in more var...
104
Voted
NIPS
2004
15 years 2 months ago
2004
Semantic taxonomies such as WordNet provide a rich source of knowledge for natural language processing applications, but are expensive to build, maintain, and extend. Motivated by...
113
click to vote
SIGMOD
2004
ACM
16 years 25 days ago
2004
ACM
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
118
Voted
AAIM
2007
Springer
15 years 6 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...