702 search results - page 46 / 141 » Identifying Graph Automorphisms Using Determining Sets |
ICDAR
1999
IEEE
15 years 4 months ago
1999
IEEE
A method is presented for segmenting documents into conceptually related areas. Determining the equivalence of text is often based on the number of word repetitions. This approach...
176
click to vote
SIGMOD
2007
ACM
15 years 12 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
ICDM
2002
IEEE
15 years 4 months ago
2002
IEEE
Document clustering techniques mostly rely on single term analysis of the document data set, such as the Vector Space Model. To better capture the structure of documents, the unde...
125
click to vote
BCB
2010
14 years 6 months ago
2010
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...