Natalia Vanetik

According to our database1, Natalia Vanetik authored at least 23 papers between 2002 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Summarizing Weibo with Topics Compression.
Proceedings of the Computational Linguistics and Intelligent Text Processing, 2017

Query-based summarization using MDL principle.
Proceedings of the Workshop on Summarization and Summary Evaluation Across Source Types and Genres, 2017

2016
What's up on Twitter? Catch up with TWIST!
Proceedings of the COLING 2016, 2016

MUSEEC: A Multilingual Text Summarization Tool.
Proceedings of ACL-2016 System Demonstrations, Berlin, Germany, August 7-12, 2016, 2016

2015
Multilingual Summarization with Polytope Model.
Proceedings of the SIGDIAL 2015 Conference, 2015

Krimping texts for better summarization.
Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, 2015

Improving Summarization Quality with Topic Modeling.
Proceedings of the 2015 Workshop on Topic Models: Post-Processing and Applications, 2015

2014
Multi-document Summarization using Tensor Decomposition.
Computación y Sistemas, 2014

Redundancy-weighting for better inference of protein structural features.
Bioinformatics, 2014

2013
Mining the Gaps: Towards Polynomial Summarization.
Proceedings of the Sixth International Joint Conference on Natural Language Processing, 2013

2012
On the fractionality of the path packing problem.
J. Comb. Optim., 2012

Classification of Datasets with Frequent Itemsets is Wild.
Proceedings of the KDIR 2012 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval, Barcelona, Spain, 4, 2012

Polytope Model for Extractive Summarization.
Proceedings of the KDIR 2012 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval, Barcelona, Spain, 4, 2012

2011
HashMax: A New Method for Mining Maximal Frequent Itemsets.
Proceedings of the KDIR 2011, 2011

Mining Graphs of Prescribed Connectivity.
Proceedings of the Knowledge Discovery, Knowledge Engineering and Knowledge Management, 2011

A Fast Algorithm for Mining Graphs of Prescribed Connectivity.
Proceedings of the KDIR 2011, 2011

2010
Mining Graphs with Constraints on Symmetry and Diameter.
Proceedings of the Web-Age Information Management, 2010

2009
Path packing and a related optimization problem.
J. Comb. Optim., 2009

Subsea: an efficient heuristic algorithm for subgraph isomorphism.
Data Min. Knowl. Discov., 2009

2006
Discovering Frequent Graph Patterns Using Disjoint Paths.
IEEE Trans. Knowl. Data Eng., 2006

Support measures for graph data.
Data Min. Knowl. Discov., 2006

2004
Mining Frequent Labeled and Partially Labeled Graph Patterns.
Proceedings of the 20th International Conference on Data Engineering, 2004

2002
Computing Frequent Graph Patterns from Semistructured Data.
Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 2002


  Loading...