Patrick K. Nicholson

According to our database1, Patrick K. Nicholson authored at least 46 papers between 2008 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Automated assessment of knowledge hierarchy evolution: comparing directed acyclic graphs.
Inf. Retr. Journal, 2019

Revisiting explicit adaptive two-probe schemes.
Inf. Process. Lett., 2019

Cartel: A System for Collaborative Transfer Learning at the Edge.
Proceedings of the ACM Symposium on Cloud Computing, SoCC 2019, 2019

Monitorless: Predicting Performance Degradation in Cloud Applications with Machine Learning.
Proceedings of the 20th International Middleware Conference, 2019

2018
Prioritized Relationship Analysis in Heterogeneous Information Networks.
TKDD, 2018

Encoding nearest larger values.
Theor. Comput. Sci., 2018

Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Enriching Taxonomies With Functional Domain Knowledge.
Proceedings of the 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, 2018

Automated Knowledge Hierarchy Assessment.
Proceedings of the Joint Proceedings of the First International Workshop on Professional Search (ProfS2018); the Second Workshop on Knowledge Graphs and Semantics for Text Retrieval, 2018

Efficient Auto-Generation of Taxonomies for Structured Knowledge Discovery and Organization.
Proceedings of the 29th on Hypertext and Social Media, 2018

Auto-Scaling with Apprenticeship Learning.
Proceedings of the ACM Symposium on Cloud Computing, 2018

ANNOTATE: orgANizing uNstructured cOntenTs viA Topic labEls.
Proceedings of the IEEE International Conference on Big Data, 2018

2017
Breaking Cycles In Noisy Hierarchies.
Proceedings of the 2017 ACM on Web Science Conference, 2017

Optimal Query Time for Encoding Range Majority.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Optimal Distance Labeling Schemes for Trees.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Scalable Disambiguation System Capturing Individualities of Mentions.
Proceedings of the Language, Data, and Knowledge - First International Conference, 2017

Efficient Set Intersection Counting Algorithm for Text Similarity Measures.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016
Compressed Representations of Graphs.
Encyclopedia of Algorithms, 2016

Dynamic range majority data structures.
Theor. Comput. Sci., 2016

Distributed Entity Disambiguation with Per-Mention Learning.
CoRR, 2016

Succinct Posets.
Algorithmica, 2016

What Links Alice and Bob?: Matching and Ranking Semantic Patterns in Heterogeneous Networks.
Proceedings of the 25th International Conference on World Wide Web, 2016

A General Framework for Dynamic Succinct and Compressed Data Structures.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015
Algorithms in the Ultra-Wide Word Model.
Proceedings of the Theory and Applications of Models of Computation, 2015

Optimal Encodings for Range Top- k k , Selection, and Min-Max.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Encoding Nearest Larger Values.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Encodings of Range Maximum-Sum Segment Queries and Applications.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014
On the compression of search trees.
Inf. Process. Manag., 2014

Cache-Oblivious VAT-Algorithms.
CoRR, 2014

Optimal Encodings for Range Min-Max and Top-k.
CoRR, 2014

Improved Explicit Data Structures in the Bitprobe Model.
Proceedings of the Algorithms - ESA 2014, 2014

Weighted Ancestors in Suffix Trees.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Space-Efficient Data Structures in the Word-RAM and Bitprobe Models.
PhD thesis, 2013

Range majority in constant time and linear space.
Inf. Comput., 2013

The Distance 4-Sector of Two Points Is Unique.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

A Survey of Data Structures in the Bitprobe Model.
Proceedings of the Space-Efficient Data Structures, 2013

2012
A Space-Efficient Framework for Dynamic Point Location.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Differentially Encoded Search Trees.
Proceedings of the 2012 Data Compression Conference, Snowbird, UT, USA, April 10-12, 2012, 2012

2011
Untangled monotonic chains and adaptive range search.
Theor. Comput. Sci., 2011

Dynamic Range Majority Data Structures
CoRR, 2011

Finding Frequent Elements in Compressed 2D Arrays and Strings.
Proceedings of the String Processing and Information Retrieval, 2011

Space Efficient Wavelet Tree Construction.
Proceedings of the String Processing and Information Retrieval, 2011

Dynamic Range Selection in Linear Space.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
Range Queries over Untangled Chains.
Proceedings of the String Processing and Information Retrieval, 2010

Hausdorff core of a one reflex vertex polygon.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2008
Unification of Arrays in Spreadsheets with Logic Programming.
Proceedings of the Practical Aspects of Declarative Languages, 2008


  Loading...