output
20152026
most citedMore Diverse Means Better: Multimodal Deep Learning Meets Remote Sensing Imagery Classification

1.4k citations

Showing cs.DSShow all

14 papers · 1 filter

cs.DS2020

Rank/Select Queries over Mutable Bitmaps

Giulio Ermanno Pibiri, Shunsuke Kanda

The problem of answering rank/select queries over a bitmap is of utmost importance for many succinct data structures. When the bitmap does not change, many solutions exist in the t…

cs.DS2020★ 41 cited

Hypergraph Clustering Based on PageRank

Yuuki Takai, Atsushi Miyauchi, Masahiro Ikeda +1

A hypergraph is a useful combinatorial object to model ternary or higher-order relations among entities. Clustering hypergraphs is a fundamental task in network analysis. In this s…

cs.DS2019

Dynamic Path-Decomposed Tries

Shunsuke Kanda, Dominik Köppl, Yasuo Tabei +2

A keyword dictionary is an associative array whose keys are strings. Recent applications handling massive keyword dictionaries in main memory have a need for a space-efficient impl…

cs.DS2019★ 1 cited

An efficient branch-and-cut algorithm for approximately submodular function maximization

Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara

When approaching to problems in computer science, we often encounter situations where a subset of a finite set maximizing some utility function needs to be selected. Some of such u…

cs.DS2019★ 5 cited

c-trie++: A Dynamic Trie Tailored for Fast Prefix Searches

Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda +4

Given a dynamic set of strings of total length whose characters are drawn from an alphabet of size , a keyword dictionary is a data structure built on that provi…

cs.DS2018

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity

Evmorfia Argyriou, Sabine Cornelsen, Henry Förster +5

While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of c…