11 citations · 33 across the 11 of their papers we have counts for
12 papers
Guaranteeing the Õ(AGM/OUT) Runtime for Uniform Sampling and OUT Size Estimation over Joins
Kyoungmin Kim, Jaehyun Ha, George Fletcher +1
We propose a new method for estimating the number of answers OUT of a small join query Q in a large database D, and for uniform sampling over joins. Our method is the first to sati…
Generalizable Implicit Neural Representations via Instance Pattern Composers
Chiheon Kim, Doyup Lee, Saehoon Kim +2
Despite recent advances in implicit neural representations (INRs), it remains challenging for a coordinate-based multi-layer perceptron (MLP) of INRs to learn a common representati…
Draft-and-Revise: Effective Image Generation with Contextual RQ-Transformer
Doyup Lee, Chiheon Kim, Saehoon Kim +2
Although autoregressive models have achieved promising results on image generation, their unidirectional generation process prevents the resultant images from fully reflecting glob…
Autoregressive Image Generation using Residual Quantization
Doyup Lee, Chiheon Kim, Saehoon Kim +2
For autoregressive (AR) modeling of high-resolution images, vector quantization (VQ) represents an image as a sequence of discrete codes. A short sequence length is important for a…
Contrastive Regularization for Semi-Supervised Learning
Doyup Lee, Sungwoong Kim, Ildoo Kim +3
Consistency regularization on label predictions becomes a fundamental technique in semi-supervised learning, but it still requires a large number of training iterations for high pe…
Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Canned Pattern Selection for Large Networks
Zifeng Yuan, Huey Eng Chua, Sourav S Bhowmick +3
Canned patterns (i.e. small subgraph patterns) in visual graph query interfaces (a.k.a GUI) facilitate efficient query formulation by enabling pattern-at-a-time construction mode.…
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming
Seunghwan Min, Sung Gwan Park, Kunsoo Park +3
In many real datasets such as social media streams and cyber data sources, graphs change over time through a graph update stream of edge insertions and deletions. Detecting critica…
[Technical Report] Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation
Kyoungmin Kim, Hyeonji Kim, George Fletcher +1
Graph pattern cardinality estimation is the problem of estimating the number of embeddings of a query graph in a data graph. This fundamental problem arises, for example, during qu…
Regularizing Attention Networks for Anomaly Detection in Visual Question Answering
Doyup Lee, Yeongjae Cheon, Wook-Shin Han
For stability and reliability of real-world applications, the robustness of DNNs in unimodal tasks has been evaluated. However, few studies consider abnormal situations that a visu…
Fast and Robust Distributed Subgraph Enumeration
Xuguang Ren, Junhu Wang, Wook-Shin Han +1
We study the classic subgraph enumeration problem under distributed settings. Existing solutions either suffer from severe memory crisis or rely on large indexes, which makes them…
Taming Subgraph Isomorphism for RDF Query Processing
Jinha Kim, Hyungyu Shin, Wook-Shin Han +2
RDF data are used to model knowledge in various areas such as life sciences, Semantic Web, bioinformatics, and social graphs. The size of real RDF data reaches billions of triples.…
Structural Consistency: Enabling XML Keyword Search to Eliminate Spurious Results Consistently
Ki-Hoon Lee, Kyu-Young Whang, Wook-Shin Han +1
XML keyword search is a user-friendly way to query XML data using only keywords. In XML keyword search, to achieve high precision without sacrificing recall, it is important to rem…