( en | de | ru )

 

Disambiguation of "Uno, Takeaki"

Author of the publication

copydeleteadd this publication to your clipboard
An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases.

, , , and . Discovery Science, volume 3245 of Lecture Notes in Computer Science, page 16-31. Springer, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Uno Pesonen

Petra Unold

Denzo Uno

Uno Kaur

Wolfram Unold

 

Other publications of authors with the same name

Listing Chordal Graphs and Interval Graphs., , and . WG, volume 4271 of Lecture Notes in Computer Science, page 68-77. Springer, (2006)Optimization algorithm for k-anonymization of datasets with low information loss., and . Int. J. Inf. Sec., 17 (6): 631-644 (2018)A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs., , , , and . CoRR, (2014)An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence., and . J. Comb. Optim., 13 (3): 243-262 (2007)Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width., and . TAMC, volume 6648 of Lecture Notes in Computer Science, page 483-494. Springer, (2011)Single versus Multiple Sorting in All Pairs Similarity Search., , , and . ACML, volume 13 of JMLR Proceedings, page 145-160. JMLR.org, (2010)Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph., , , , and . COCOON, volume 10392 of Lecture Notes in Computer Science, page 150-161. Springer, (2017)Transforming spanning trees: A lower bound., , , and . Comput. Geom., 42 (8): 724-730 (2009)On listing, sampling, and counting the chordal graphs with edge constraints., , , and . Theor. Comput. Sci., 411 (26-28): 2591-2601 (2010)A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number., , , and . Theor. Comput. Sci., (2021)