title string | abstract string | url string | arxiv_id string | date string | category string |
|---|---|---|---|---|---|
1-OGC: The first open gravitational-wave catalog of binary mergers from analysis of public Advanced LIGO data | We present the first Open Gravitational-wave Catalog (1-OGC), obtained by
using the public data from Advanced LIGO's first observing run to search for
compact-object binary mergers. Our analysis is based on new methods that
improve the separation between signals and noise in matched-filter searches for
gravitational wa... | http://arxiv.org/abs/1811.01921v2 | 1811.01921 | 2018-11-05 | cybersecurity |
1 {\Omega}-10 k{\Omega} high precision transportable setup to calibrate multifunction electrical instruments | A temperature controlled 1 {\Omega}-10 k{\Omega} standard Resistors
transportable setup was developed at National Institute of Metrological
Research, (INRIM) for the calibration and adjustment of multifunction
electrical instruments. The two Standards consist respectively of two 10
{\Omega} and 100 k{\Omega} parallel c... | http://arxiv.org/abs/1505.04398v1 | 1505.04398 | 2015-05-17 | cybersecurity |
1-out-of-2 Oblivious transfer using flawed Bit-string quantum protocol | Oblivious transfer (OT) is an important tool in cryptography. It serves as a
subroutine to other complex procedures of both theoretical and practical
significance. Common attribute of OT protocols is that one party (Alice) has to
send a message to another party (Bob) and has to stay oblivious on whether Bob
did receive... | http://arxiv.org/abs/1611.10087v1 | 1611.10087 | 2016-11-30 | cybersecurity |
1-out-of-n Oblivious Signatures: Security Revisited and a Generic Construction with an Efficient Communication Cost | 1-out-of-n oblivious signature by Chen (ESORIC 1994) is a protocol between the user and the signer. In this scheme, the user makes a list of n messages and chooses the message that the user wants to obtain a signature from the list. The user interacts with the signer by providing this message list and obtains the signa... | https://arxiv.org/abs/2404.00602v1 | 2404.00602 | 2024-03-31 | cybersecurity |
1-PAGER: One Pass Answer Generation and Evidence Retrieval | We present 1-Pager the first system that answers a question and retrieves evidence using a single Transformer-based model and decoding process. 1-Pager incrementally partitions the retrieval corpus using constrained decoding to select a document and answer string, and we show that this is competitive with comparable re... | https://arxiv.org/abs/2310.16568v1 | 2310.16568 | 2023-10-25 | cybersecurity |
1 Particle - 1 Qubit: Particle Physics Data Encoding for Quantum Machine Learning | We introduce 1P1Q, a novel quantum data encoding scheme for high-energy physics (HEP), where each particle is assigned to an individual qubit, enabling direct representation of collision events without classical compression. We demonstrate the effectiveness of 1P1Q in quantum machine learning (QML) through two applicat... | https://arxiv.org/abs/2502.17301v1 | 2502.17301 | 2025-02-24 | cybersecurity |
1-perfectly orientable graphs and graph products | A graph G is said to be 1-perfectly orientable (1-p.o. for short) if it
admits an orientation such that the out-neighborhood of every vertex is a
clique in G. The class of 1-p.o. graphs forms a common generalization of the
classes of chordal and circular arc graphs. Even though 1-p.o. graphs can be
recognized in polyno... | http://arxiv.org/abs/1511.07314v2 | 1511.07314 | 2016-08-30 | cybersecurity |
$1$-perfectly orientable $K_4$-minor-free and outerplanar graphs | A graph $G$ is said to be $1$-perfectly orientable if it has an orientation
such that for every vertex $v\in V(G)$, the out-neighborhood of $v$ in $D$ is a
clique in $G$. In $1982$, Skrien posed the problem of characterizing the class
of $1$-perfectly orientable graphs. This graph class forms a common
generalization of... | http://arxiv.org/abs/1604.04598v2 | 1604.04598 | 2016-04-19 | cybersecurity |
1-planar graphs are odd 13-colorable | An odd coloring of a graph $G$ is a proper coloring such that any non-isolated vertex in $G$ has a coloring appears odd times on its neighbors. The odd chromatic number, denoted by $\chi_o(G)$, is the minimum number of colors that admits an odd coloring of $G$. Petru\v{s}evski and \v{S}krekovski in 2021 introduced this... | https://arxiv.org/abs/2206.13967v1 | 2206.13967 | 2022-06-28 | cybersecurity |
1-planar graphs with minimum degree at least 3 have bounded girth | We show that every 1-planar graph with minimum degree at least 4 has girth at
most $8$, and every 1-planar graph with minimum degree at least 3 has girth at
most $198$. | http://arxiv.org/abs/2001.05402v2 | 2001.05402 | 2020-01-16 | cybersecurity |
1-planar unit distance graphs | A matchstick graph is a plane graph with edges drawn as unit distance line segments. This class of graphs was introduced by Harborth who conjectured that a matchstick graph on $n$ vertices can have at most $\lfloor 3n - \sqrt{12n - 3}\rfloor$ edges. Recently his conjecture was settled by Lavoll\'ee and Swanepoel. In th... | https://arxiv.org/abs/2310.00940v1 | 2310.00940 | 2023-10-02 | cybersecurity |
1PN effective binary Lagrangian for the gravity-Kalb-Ramond sector in the conservative regime | Within the framework of string theory, a number of new fields are possible correcting the Einstein-Hilbert action, including a Kalb-Ramond two-form field. In this work we derive explicitly first order relativistic corrections to conservative dynamics with a Kalb-Ramond field, using the effective field theory approach. ... | https://arxiv.org/abs/2312.11322v1 | 2312.11322 | 2023-12-18 | cybersecurity |
1-Point Functions for $\mathbb{Z}_2$-orbifolds of Lattice VOAs | In this paper, we compute the 1-point correlation functions of all states for the $\mathbb{Z}_2$-orbifolds of lattice vertex operator algebras. | https://arxiv.org/abs/2505.02954v1 | 2505.02954 | 2025-05-05 | cybersecurity |
1-point functions for symmetrized Heisenberg and symmetrized lattice vertex operator algebras | We obtain explicit formulas for the $1$-point functions of all states in the symmetrized Heisenberg algebra $M^+$ and symmetrized lattice VOAs $V_L^+$. For this we employ a new $\mathbf Z_2$-twisted variant of so-called Zhu recursion. | https://arxiv.org/abs/2204.08318v1 | 2204.08318 | 2022-04-18 | cybersecurity |
1-Point RANSAC-Based Method for Ground Object Pose Estimation | Solving Perspective-n-Point (PnP) problems is a traditional way of estimating object poses. Given outlier-contaminated data, a pose of an object is calculated with PnP algorithms of n = {3, 4} in the RANSAC-based scheme. However, the computational complexity considerably increases along with n and the high complexity i... | https://arxiv.org/abs/2008.03718v2 | 2008.03718 | 2020-08-09 | cybersecurity |
1-point RANSAC for Circular Motion Estimation in Computed Tomography (CT) | This paper proposes a RANSAC-based algorithm for determining the axial rotation angle of an object from a pair of its tomographic projections. An equation is derived for calculating the rotation angle using one correct keypoints correspondence of two tomographic projections. The proposed algorithm consists of the follo... | https://arxiv.org/abs/1910.01681v1 | 1910.01681 | 2019-10-03 | cybersecurity |
$1$-product problems with congruence conditions in nonabelian groups | Let $G$ be a finite group and $D_{2n}$ be the dihedral group of $2n$
elements. For a positive integer $d$, let $\mathsf{s}_{d\mathbb{N}}(G)$ denote
the smallest integer $\ell\in \mathbb{N}_0\cup \{+\infty\}$ such that every
sequence $S$ over $G$ of length $|S|\geq \ell$ has a nonempty $1$-product
subsequence $T$ with $... | http://arxiv.org/abs/2003.14007v1 | 2003.14007 | 2020-03-31 | cybersecurity |
(1,p)-Sobolev spaces based on strongly local Dirichlet forms | In the framework of quasi-regular strongly local Dirichlet form $(\mathscr{E},D(\mathscr{E}))$ on $L^2(X;\mathfrak{m})$ admitting minimal $\mathscr{E}$-dominant measure $\mu$, we construct a natural $p$-energy functional $(\mathscr{E}^{\,p},D(\mathscr{E}^{\,p}))$ on $L^p(X;\mathfrak{m})$ and $(1,p)$-Sobolev space $(H^{... | https://arxiv.org/abs/2310.11652v2 | 2310.11652 | 2023-10-18 | cybersecurity |
$1/Q^2$ power corrections to TMD factorization for Drell-Yan hadronic tensor | I calculate ${1\over Q^2}$ power corrections to unpolarized Drell-Yan hadronic tensor for electromagnetic (EM) current at large $N_c$ and demonstrate the EM gauge invariance at this level. | https://arxiv.org/abs/2404.15116v3 | 2404.15116 | 2024-04-23 | cybersecurity |
1RXH J082623.6-505741: a new long-period cataclysmic variable with an evolved donor and a low mass transfer rate | We report the discovery of 1RXH J082623.6-505741, a 10.4 hr orbital period compact binary. Modeling extensive optical photometry and spectroscopy reveals a $\sim 0.4 M_{\odot}$ K-type secondary transferring mass through a low-state accretion disk to a non-magnetic $\sim 0.8 M_{\odot}$ white dwarf. The secondary is over... | https://arxiv.org/abs/2206.10625v1 | 2206.10625 | 2022-06-21 | cybersecurity |
1RXS J161935.7+524630: New Polar with the Varying Accretion Modes on two Magnetic Poles | We report the discovery of a new cataclysmic variable DDE 32 identified with
the ROSAT X-ray source 1RXS J161935.7+524630 in Draco. The variability was
originally found by D. Denisenko on the digitized Palomar plates centered at
the position of X-ray source. The photometric observations by F. Martinelli at
Lajatico Ast... | http://arxiv.org/abs/1609.08511v1 | 1609.08511 | 2016-09-27 | cybersecurity |
1RXS J180408.9-342058: an ultra compact X-ray binary candidate with a transient jet | We present a detailed NIR/optical/UV study of the transient low mass X-ray
binary 1RXS J180408.9-342058 performed during its 2015 outburst, aimed at
determining the nature of its companion star. We obtained three optical spectra
at the 2.1 m San Pedro Martir Observatory telescope (Mexico). We performed
optical and NIR ... | http://arxiv.org/abs/1601.05091v1 | 1601.05091 | 2016-01-19 | cybersecurity |
$^1S_0$ pairing for neutrons in dense neutron matter induced by a soft pion | The possibility of neutron pairing in the $^1S_0$ channel is studied for
dense neutron matter in a vicinity of the $\pi^0$ condensation point. The
$^1S_0$ pairing gap $\Delta$ is shown to occur in a model with a pairing force
induced by the exchange of a soft neutral pionic mode. The soft pion induced
potential $V_{\pi... | http://arxiv.org/abs/1409.7225v2 | 1409.7225 | 2015-01-19 | cybersecurity |
$^1$S$_0$ pairing gaps, chemical potential and entrainment matrix in superfluid neutron-star cores for the Brussels-Montreal functionals | Temperature and velocity-dependent $^1$S$_0$ pairing gaps, chemical potentials and entrainment matrix in dense homogeneous neutron-proton superfluid mixtures constituting the outer core of neutron stars, are determined fully self-consistently by solving numerically the time-dependent Hartree-Fock-Bogoliubov equations o... | https://arxiv.org/abs/2203.08778v1 | 2203.08778 | 2022-03-16 | cybersecurity |
$^1S_0$ pairing in neutron matter | We report calculations of the superfluid pairing gap in neutron matter for
the $^1S_0$ components of the Reid soft-core $V_6$ and the Argonne $V_{4}'$
two-nucleon interactions. Ground-state calculations have been carried out using
the central part of the operator-basis representation of these interactions to
determine ... | http://arxiv.org/abs/1707.07268v1 | 1707.07268 | 2017-07-23 | cybersecurity |
1S-3S cw spectroscopy of hydrogen/deuterium atom | We study the 1S-3S two-photon transition of hydrogen in a thermal atomic beam, using a homemade cw laser source at 205 nm. The experimental method is described, leading in 2017 to the measurement of the 1S-3S transition frequency in hydrogen atom with a relative uncertainty of $9 \times 10^{-13}$. This result contribut... | https://arxiv.org/abs/2302.07537v1 | 2302.07537 | 2023-02-15 | cybersecurity |
1-Safe Petri nets and special cube complexes: equivalence and applications | Nielsen, Plotkin, and Winskel (1981) proved that every 1-safe Petri net $N$
unfolds into an event structure $\mathcal{E}_N$. By a result of Thiagarajan
(1996 and 2002), these unfoldings are exactly the trace regular event
structures. Thiagarajan (1996 and 2002) conjectured that regular event
structures correspond exact... | http://arxiv.org/abs/1810.03395v2 | 1810.03395 | 2019-04-24 | cybersecurity |
1-Shell totally symmetric plane partitions (TSPPs) modulo powers of 5 | Let $s(n)$ be the number of 1-shell totally symmetric plane partitions
(TSPPs) of $n$. In this paper, an infinite family of congruences modulo powers
of $5$ for $s(n)$ will be deduced through an elementary approach. Namely,
$$s\left(2\cdot 5^{2\alpha-1}n+5^{2\alpha-1}\right)\equiv 0
\pmod{5^{\alpha}}.$$ | http://arxiv.org/abs/1802.04344v2 | 1802.04344 | 2020-03-26 | cybersecurity |
1-shifted Lie bialgebras and their quantizations | In this paper, we define (cohomologically) 1-shifted Manin triples and 1-shifted Lie bialgebras, and study their properties. We derive many results that are parallel to those found in ordinary Lie bialgebras, including the double construction and the existence of a 1-shifted $r$-matrix satisfying the classical Yang-Bax... | https://arxiv.org/abs/2503.08770v1 | 2503.08770 | 2025-03-11 | cybersecurity |
1-Shot Oblivious Transfer and 2-Party Computation from Noisy Quantum Storage | Few primitives are as intertwined with the foundations of cryptography as Oblivious Transfer (OT). Not surprisingly, with the advent of the use of quantum resources in information processing, OT played a central role in establishing new possibilities (and defining impossibilities) pertaining to the use of these novel a... | https://arxiv.org/abs/2410.08367v1 | 2410.08367 | 2024-10-10 | cybersecurity |
1-skeletons of the spanning tree problems with additional constraints | We consider the polyhedral properties of two spanning tree problems with
additional constraints. In the first problem, it is required to find a tree
with a minimum sum of edge weights among all spanning trees with the number of
leaves less or equal a given value. In the second problem, an additional
constraint is the a... | http://arxiv.org/abs/1710.09672v1 | 1710.09672 | 2017-10-26 | cybersecurity |
1-smooth pro-p groups and Bloch-Kato pro-p groups | Let $p$ be a prime. A pro-$p$ group $G$ is said to be 1-smooth if it can be endowed with a homomorphism of pro-$p$ groups $G\to1+p\mathbb{Z}_p$ satisfying a formal version of Hilbert 90. By Kummer theory, maximal pro-$p$ Galois groups of fields containing a root of 1 of order $p$, together with the cyclotomic character... | https://arxiv.org/abs/1904.00667v7 | 1904.00667 | 2019-04-01 | cybersecurity |
1SPU: 1-step Speech Processing Unit | Recent studies have made some progress in refining end-to-end (E2E) speech recognition encoders by applying Connectionist Temporal Classification (CTC) loss to enhance named entity recognition within transcriptions. However, these methods have been constrained by their exclusive use of the ASCII character set, allowing... | https://arxiv.org/abs/2311.04753v3 | 2311.04753 | 2023-11-08 | cybersecurity |
$1$-stable fluctuation of the derivative martingale of branching random walk | In this paper, we study the functional convergence in law of the fluctuations of the derivative martingale of branching random walk on the real line. Our main result strengthens the results of Buraczewski et. al. [Ann. Probab., 2021] and is the branching random walk counterpart of the main result of Maillard and Pain [... | https://arxiv.org/abs/2311.16407v1 | 2311.16407 | 2023-11-28 | cybersecurity |
1-stable fluctuations in branching Brownian motion at critical temperature II: general functionals | Let $\mu_t$ denote the critical derivative Gibbs measure of branching Brownian motion at time $t$. It has been proved by Madaule [Stochastic Process. Appl., 126(2):470--502, 2016] and Maillard and Zeitouni [Ann. Inst. Henri Poincar\'e Probab. Stat., 52(3):1144--1160, 2016] that $\mu_t$ converges weakly to the random me... | https://arxiv.org/abs/2103.10412v1 | 2103.10412 | 2021-03-18 | cybersecurity |
1-stable fluctuations in branching Brownian motion at critical temperature I: the derivative martingale | Let $(Z_t)_{t\geq 0}$ denote the derivative martingale of branching Brownian
motion, i.e.\@ the derivative with respect to the inverse temperature of the
normalized partition function at critical temperature. A well-known result by
Lalley and Sellke [\textit{Ann. Probab.}, 15(3):1052--1061, 1987] says that
this marting... | http://arxiv.org/abs/1806.05152v2 | 1806.05152 | 2018-06-19 | cybersecurity |
1st AfricaNLP Workshop Proceedings, 2020 | Proceedings of the 1st AfricaNLP Workshop held on 26th April alongside ICLR 2020, Virtual Conference, Formerly Addis Ababa Ethiopia. | https://arxiv.org/abs/2011.10361v1 | 2011.10361 | 2020-11-20 | cybersecurity |
1st eigenvalue pinching for convex hypersurfaces in a Riemannian manifold | Let $M^n$ be a closed convex hypersurface lying in a convex ball $B(p,R)$ of
the ambient $(n+1)$-manifold $N^{n+1}$. We prove that, by pinching
Heintze-Reilly's inequality via sectional curvature upper bound of $B(p,R)$,
1st eigenvalue and mean curvature of $M$, not only $M$ is Hausdorff close and
almost isometric to a... | http://arxiv.org/abs/1905.05572v1 | 1905.05572 | 2019-05-14 | cybersecurity |
1st ICLR International Workshop on Privacy, Accountability, Interpretability, Robustness, Reasoning on Structured Data (PAIR^2Struct) | Recent years have seen advances on principles and guidance relating to accountable and ethical use of artificial intelligence (AI) spring up around the globe. Specifically, Data Privacy, Accountability, Interpretability, Robustness, and Reasoning have been broadly recognized as fundamental principles of using machine l... | https://arxiv.org/abs/2210.03612v1 | 2210.03612 | 2022-10-07 | cybersecurity |
1st-Order Dynamics on Nonlinear Agents for Resource Allocation over Uniformly-Connected Networks | A general nonlinear $1$st-order consensus-based solution for distributed constrained convex optimization is proposed with network resource allocation applications. The solution is used to optimize continuously-differentiable strictly convex cost functions over weakly-connected undirected networks, while it is anytime f... | https://arxiv.org/abs/2109.04822v2 | 2109.04822 | 2021-09-10 | cybersecurity |
1st-Order Magic: Analysis of Sharpness-Aware Minimization | Sharpness-Aware Minimization (SAM) is an optimization technique designed to improve generalization by favoring flatter loss minima. To achieve this, SAM optimizes a modified objective that penalizes sharpness, using computationally efficient approximations. Interestingly, we find that more precise approximations of the... | https://arxiv.org/abs/2411.01714v1 | 2411.01714 | 2024-11-03 | cybersecurity |
1st Place in ICCV 2023 Workshop Challenge Track 1 on Resource Efficient Deep Learning for Computer Vision: Budgeted Model Training Challenge | The budgeted model training challenge aims to train an efficient classification model under resource limitations. To tackle this task in ImageNet-100, we describe a simple yet effective resource-aware backbone search framework composed of profile and instantiation phases. In addition, we employ multi-resolution ensembl... | https://arxiv.org/abs/2311.11470v1 | 2311.11470 | 2023-08-09 | cybersecurity |
1st Place Solution for 5th LSVOS Challenge: Referring Video Object Segmentation | The recent transformer-based models have dominated the Referring Video Object Segmentation (RVOS) task due to the superior performance. Most prior works adopt unified DETR framework to generate segmentation masks in query-to-instance manner. In this work, we integrate strengths of that leading RVOS models to build up a... | https://arxiv.org/abs/2401.00663v1 | 2401.00663 | 2024-01-01 | cybersecurity |
1st place solution for AVA-Kinetics Crossover in AcitivityNet Challenge 2020 | This technical report introduces our winning solution to the spatio-temporal action localization track, AVA-Kinetics Crossover, in ActivityNet Challenge 2020. Our entry is mainly based on Actor-Context-Actor Relation Network. We describe technical details for the new AVA-Kinetics dataset, together with some experimenta... | https://arxiv.org/abs/2006.09116v1 | 2006.09116 | 2020-06-16 | cybersecurity |
1st Place Solution for CVPR2023 BURST Long Tail and Open World Challenges | Currently, Video Instance Segmentation (VIS) aims at segmenting and categorizing objects in videos from a closed set of training categories that contain only a few dozen of categories, lacking the ability to handle diverse objects in real-world videos. As TAO and BURST datasets release, we have the opportunity to resea... | https://arxiv.org/abs/2308.04598v1 | 2308.04598 | 2023-08-08 | cybersecurity |
1st Place Solution for ECCV 2022 OOD-CV Challenge Image Classification Track | OOD-CV challenge is an out-of-distribution generalization task. In this challenge, our core solution can be summarized as that Noisy Label Learning Is A Strong Test-Time Domain Adaptation Optimizer. Briefly speaking, our main pipeline can be divided into two stages, a pre-training stage for domain generalization and a ... | https://arxiv.org/abs/2301.04795v1 | 2301.04795 | 2023-01-12 | cybersecurity |
1st Place Solution for ECCV 2022 OOD-CV Challenge Object Detection Track | OOD-CV challenge is an out-of-distribution generalization task. To solve this problem in object detection track, we propose a simple yet effective Generalize-then-Adapt (G&A) framework, which is composed of a two-stage domain generalization part and a one-stage domain adaptation part. The domain generalization part is ... | https://arxiv.org/abs/2301.04796v1 | 2301.04796 | 2023-01-12 | cybersecurity |
1st Place Solution for ICCV 2023 OmniObject3D Challenge: Sparse-View Reconstruction | In this report, we present the 1st place solution for ICCV 2023 OmniObject3D Challenge: Sparse-View Reconstruction. The challenge aims to evaluate approaches for novel view synthesis and surface reconstruction using only a few posed images of each object. We utilize Pixel-NeRF as the basic model, and apply depth superv... | https://arxiv.org/abs/2404.10441v1 | 2404.10441 | 2024-04-16 | cybersecurity |
1st Place Solution for ICDAR 2021 Competition on Mathematical Formula Detection | In this technical report, we present our 1st place solution for the ICDAR 2021 competition on mathematical formula detection (MFD). The MFD task has three key challenges including a large scale span, large variation of the ratio between height and width, and rich character set and mathematical expressions. Considering ... | https://arxiv.org/abs/2107.05534v1 | 2107.05534 | 2021-07-12 | cybersecurity |
1st Place Solution for MeViS Track in CVPR 2024 PVUW Workshop: Motion Expression guided Video Segmentation | Motion Expression guided Video Segmentation (MeViS), as an emerging task, poses many new challenges to the field of referring video object segmentation (RVOS). In this technical report, we investigated and validated the effectiveness of static-dominant data and frame sampling on this challenging setting. Our solution a... | https://arxiv.org/abs/2406.07043v1 | 2406.07043 | 2024-06-11 | cybersecurity |
1st Place Solution for MOSE Track in CVPR 2024 PVUW Workshop: Complex Video Object Segmentation | Tracking and segmenting multiple objects in complex scenes has always been a challenge in the field of video object segmentation, especially in scenarios where objects are occluded and split into parts. In such cases, the definition of objects becomes very ambiguous. The motivation behind the MOSE dataset is how to cle... | https://arxiv.org/abs/2406.04600v1 | 2406.04600 | 2024-06-07 | cybersecurity |
1st Place Solution for PSG competition with ECCV'22 SenseHuman Workshop | Panoptic Scene Graph (PSG) generation aims to generate scene graph representations based on panoptic segmentation instead of rigid bounding boxes. Existing PSG methods utilize one-stage paradigm which simultaneously generates scene graphs and predicts semantic segmentation masks or two-stage paradigm that first adopt a... | https://arxiv.org/abs/2302.02651v1 | 2302.02651 | 2023-02-06 | cybersecurity |
1st Place Solution for PVUW Challenge 2023: Video Panoptic Segmentation | Video panoptic segmentation is a challenging task that serves as the cornerstone of numerous downstream applications, including video editing and autonomous driving. We believe that the decoupling strategy proposed by DVIS enables more effective utilization of temporal information for both "thing" and "stuff" objects. ... | https://arxiv.org/abs/2306.04091v2 | 2306.04091 | 2023-06-07 | cybersecurity |
1st Place Solution for the 5th LSVOS Challenge: Video Instance Segmentation | Video instance segmentation is a challenging task that serves as the cornerstone of numerous downstream applications, including video editing and autonomous driving. In this report, we present further improvements to the SOTA VIS method, DVIS. First, we introduce a denoising training strategy for the trainable tracker,... | https://arxiv.org/abs/2308.14392v1 | 2308.14392 | 2023-08-28 | cybersecurity |
1st Place Solution for the UVO Challenge on Image-based Open-World Segmentation 2021 | We describe our two-stage instance segmentation framework we use to compete in the challenge. The first stage of our framework consists of an object detector, which generates object proposals in the format of bounding boxes. Then, the images and the detected bounding boxes are fed to the second stage, where a segmentat... | https://arxiv.org/abs/2110.10239v1 | 2110.10239 | 2021-10-19 | cybersecurity |
1st Place Solution for Waymo Open Dataset Challenge -- 3D Detection and Domain Adaptation | In this technical report, we introduce our winning solution "HorizonLiDAR3D" for the 3D detection track and the domain adaptation track in Waymo Open Dataset Challenge at CVPR 2020. Many existing 3D object detectors include prior-based anchor box design to account for different scales and aspect ratios and classes of o... | https://arxiv.org/abs/2006.15505v1 | 2006.15505 | 2020-06-28 | cybersecurity |
1st Place Solution for YouTubeVOS Challenge 2021:Video Instance Segmentation | Video Instance Segmentation (VIS) is a multi-task problem performing detection, segmentation, and tracking simultaneously. Extended from image set applications, video data additionally induces the temporal information, which, if handled appropriately, is very useful to identify and predict object motions. In this work,... | https://arxiv.org/abs/2106.06649v2 | 2106.06649 | 2021-06-12 | cybersecurity |
1st Place Solution for YouTubeVOS Challenge 2022: Referring Video Object Segmentation | The task of referring video object segmentation aims to segment the object in the frames of a given video to which the referring expressions refer. Previous methods adopt multi-stage approach and design complex pipelines to obtain promising results. Recently, the end-to-end method based on Transformer has proved its su... | https://arxiv.org/abs/2212.14679v1 | 2212.14679 | 2022-12-27 | cybersecurity |
1st Place Solution in Google Universal Images Embedding | This paper presents the 1st place solution for the Google Universal Images Embedding Competition on Kaggle. The highlighted part of our solution is based on 1) A novel way to conduct training and fine-tuning; 2) The idea of a better ensemble in the pool of models that make embedding; 3) The potential trade-off between ... | https://arxiv.org/abs/2210.08473v1 | 2210.08473 | 2022-10-16 | cybersecurity |
1st Place Solution of Egocentric 3D Hand Pose Estimation Challenge 2023 Technical Report:A Concise Pipeline for Egocentric Hand Pose Reconstruction | This report introduce our work on Egocentric 3D Hand Pose Estimation workshop. Using AssemblyHands, this challenge focuses on egocentric 3D hand pose estimation from a single-view image. In the competition, we adopt ViT based backbones and a simple regressor for 3D keypoints prediction, which provides strong model base... | https://arxiv.org/abs/2310.04769v2 | 2310.04769 | 2023-10-07 | cybersecurity |
1st Place Solution of LVIS Challenge 2020: A Good Box is not a Guarantee of a Good Mask | This article introduces the solutions of the team lvisTraveler for LVIS Challenge 2020. In this work, two characteristics of LVIS dataset are mainly considered: the long-tailed distribution and high quality instance segmentation mask. We adopt a two-stage training pipeline. In the first stage, we incorporate EQL and se... | https://arxiv.org/abs/2009.01559v1 | 2009.01559 | 2020-09-03 | cybersecurity |
1st Place Solution of Multiview Egocentric Hand Tracking Challenge ECCV2024 | Multi-view egocentric hand tracking is a challenging task and plays a critical role in VR interaction. In this report, we present a method that uses multi-view input images and camera extrinsic parameters to estimate both hand shape and pose. To reduce overfitting to the camera layout, we apply crop jittering and extri... | https://arxiv.org/abs/2409.19362v2 | 2409.19362 | 2024-09-28 | cybersecurity |
1st Place Solution of The Robust Vision Challenge 2022 Semantic Segmentation Track | This report describes the winning solution to the Robust Vision Challenge (RVC) semantic segmentation track at ECCV 2022. Our method adopts the FAN-B-Hybrid model as the encoder and uses SegFormer as the segmentation framework. The model is trained on a composite dataset consisting of images from 9 datasets (ADE20K, Ci... | https://arxiv.org/abs/2210.12852v3 | 2210.12852 | 2022-10-23 | cybersecurity |
1$^{st}$ Place Solution of WWW 2025 EReL@MIR Workshop Multimodal CTR Prediction Challenge | The WWW 2025 EReL@MIR Workshop Multimodal CTR Prediction Challenge focuses on effectively applying multimodal embedding features to improve click-through rate (CTR) prediction in recommender systems. This technical report presents our 1$^{st}$ place winning solution for Task 2, combining sequential modeling and feature... | https://arxiv.org/abs/2505.03543v1 | 2505.03543 | 2025-05-06 | cybersecurity |
1st Place Solutions for OpenImage2019 -- Object Detection and Instance Segmentation | This article introduces the solutions of the two champion teams, `MMfruit' for the detection track and `MMfruitSeg' for the segmentation track, in OpenImage Challenge 2019. It is commonly known that for an object detector, the shared feature at the end of the backbone is not appropriate for both classification and regr... | https://arxiv.org/abs/2003.07557v1 | 2003.07557 | 2020-03-17 | cybersecurity |
1st Place Solutions for RxR-Habitat Vision-and-Language Navigation Competition (CVPR 2022) | This report presents the methods of the winning entry of the RxR-Habitat Competition in CVPR 2022. The competition addresses the problem of Vision-and-Language Navigation in Continuous Environments (VLN-CE), which requires an agent to follow step-by-step natural language instructions to reach a target. We present a mod... | https://arxiv.org/abs/2206.11610v2 | 2206.11610 | 2022-06-23 | cybersecurity |
1st Place Solutions for the UVO Challenge 2022 | This paper describes the approach we have taken in the challenge. We still adopted the two-stage scheme same as the last champion, that is, detection first and segmentation followed. We trained more powerful detector and segmentor separately. Besides, we also perform pseudo-label training on the test set, based on stud... | https://arxiv.org/abs/2210.09629v1 | 2210.09629 | 2022-10-18 | cybersecurity |
1st Place Solutions for UG2+ Challenge 2021 -- (Semi-)supervised Face detection in the low light condition | In this technical report, we briefly introduce the solution of our team "TAL-ai" for (Semi-) supervised Face detection in the low light condition in UG2+ Challenge in CVPR 2021. By conducting several experiments with popular image enhancement methods and image transfer methods, we pulled the low light image and the nor... | https://arxiv.org/abs/2107.00818v1 | 2107.00818 | 2021-07-02 | cybersecurity |
1st Place Solutions for UG2+ Challenge 2022 ATMOSPHERIC TURBULENCE MITIGATION | In this technical report, we briefly introduce the solution of our team ''summer'' for Atomospheric Turbulence Mitigation in UG$^2$+ Challenge in CVPR 2022. In this task, we propose a unified end-to-end framework to reconstruct a high quality image from distorted frames, which is mainly consists of a Restormer-based im... | https://arxiv.org/abs/2210.16847v1 | 2210.16847 | 2022-10-30 | cybersecurity |
1st Place Solutions for Waymo Open Dataset Challenges -- 2D and 3D Tracking | This technical report presents the online and real-time 2D and 3D multi-object tracking (MOT) algorithms that reached the 1st places on both Waymo Open Dataset 2D tracking and 3D tracking challenges. An efficient and pragmatic online tracking-by-detection framework named HorizonMOT is proposed for camera-based 2D track... | https://arxiv.org/abs/2006.15506v1 | 2006.15506 | 2020-06-28 | cybersecurity |
1st Place Solutions of Waymo Open Dataset Challenge 2020 -- 2D Object Detection Track | In this technical report, we present our solutions of Waymo Open Dataset (WOD) Challenge 2020 - 2D Object Track. We adopt FPN as our basic framework. Cascade RCNN, stacked PAFPN Neck and Double-Head are used for performance improvements. In order to handle the small object detection problem in WOD, we use very large im... | https://arxiv.org/abs/2008.01365v1 | 2008.01365 | 2020-08-04 | cybersecurity |
1st Place Solution to ECCV 2022 Challenge on Out of Vocabulary Scene Text Understanding: End-to-End Recognition of Out of Vocabulary Words | Scene text recognition has attracted increasing interest in recent years due to its wide range of applications in multilingual translation, autonomous driving, etc. In this report, we describe our solution to the Out of Vocabulary Scene Text Understanding (OOV-ST) Challenge, which aims to extract out-of-vocabulary (OOV... | https://arxiv.org/abs/2209.00224v1 | 2209.00224 | 2022-09-01 | cybersecurity |
1st Place Solution to ECCV-TAO-2020: Detect and Represent Any Object for Tracking | We extend the classical tracking-by-detection paradigm to this tracking-any-object task. Solid detection results are first extracted from TAO dataset. Some state-of-the-art techniques like \textbf{BA}lanced-\textbf{G}roup \textbf{S}oftmax (\textbf{BAGS}\cite{li2020overcoming}) and DetectoRS\cite{qiao2020detectors} are ... | https://arxiv.org/abs/2101.08040v2 | 2101.08040 | 2021-01-20 | cybersecurity |
1st Place Solution to Google Landmark Retrieval 2020 | This paper presents the 1st place solution to the Google Landmark Retrieval 2020 Competition on Kaggle. The solution is based on metric learning to classify numerous landmark classes, and uses transfer learning with two train datasets, fine-tuning on bigger images, adjusting loss weight for cleaner samples, and esemble... | https://arxiv.org/abs/2009.05132v1 | 2009.05132 | 2020-08-24 | cybersecurity |
1st Place Solution to ICDAR 2021 RRC-ICTEXT End-to-end Text Spotting and Aesthetic Assessment on Integrated Circuit | This paper presents our proposed methods to ICDAR 2021 Robust Reading Challenge - Integrated Circuit Text Spotting and Aesthetic Assessment (ICDAR RRC-ICTEXT 2021). For the text spotting task, we detect the characters on integrated circuit and classify them based on yolov5 detection model. We balance the lowercase and ... | https://arxiv.org/abs/2104.03544v1 | 2104.03544 | 2021-04-08 | cybersecurity |
1st Place Solution to MultiEarth 2023 Challenge on Multimodal SAR-to-EO Image Translation | The Multimodal Learning for Earth and Environment Workshop (MultiEarth 2023) aims to harness the substantial amount of remote sensing data gathered over extensive periods for the monitoring and analysis of Earth's ecosystems'health. The subtask, Multimodal SAR-to-EO Image Translation, involves the use of robust SAR dat... | https://arxiv.org/abs/2306.12626v1 | 2306.12626 | 2023-06-22 | cybersecurity |
1st Place Solution to NeurIPS 2022 Challenge on Visual Domain Adaptation | The Visual Domain Adaptation(VisDA) 2022 Challenge calls for an unsupervised domain adaptive model in semantic segmentation tasks for industrial waste sorting. In this paper, we introduce the SIA_Adapt method, which incorporates several methods for domain adaptive models. The core of our method in the transferable repr... | https://arxiv.org/abs/2211.14596v1 | 2211.14596 | 2022-11-26 | cybersecurity |
1st Place Solution to Odyssey Emotion Recognition Challenge Task1: Tackling Class Imbalance Problem | Speech emotion recognition is a challenging classification task with natural emotional speech, especially when the distribution of emotion types is imbalanced in the training and test data. In this case, it is more difficult for a model to learn to separate minority classes, resulting in those sometimes being ignored o... | https://arxiv.org/abs/2405.20064v1 | 2405.20064 | 2024-05-30 | cybersecurity |
1st Place Solution to the 1st SkatingVerse Challenge | This paper presents the winning solution for the 1st SkatingVerse Challenge. We propose a method that involves several steps. To begin, we leverage the DINO framework to extract the Region of Interest (ROI) and perform precise cropping of the raw video footage. Subsequently, we employ three distinct models, namely Unma... | https://arxiv.org/abs/2404.14032v1 | 2404.14032 | 2024-04-22 | cybersecurity |
1st Place Solution to the 8th HANDS Workshop Challenge -- ARCTIC Track: 3DGS-based Bimanual Category-agnostic Interaction Reconstruction | This report describes our 1st place solution to the 8th HANDS workshop challenge (ARCTIC track) in conjunction with ECCV 2024. In this challenge, we address the task of bimanual category-agnostic hand-object interaction reconstruction, which aims to generate 3D reconstructions of both hands and the object from a monocu... | https://arxiv.org/abs/2409.19215v2 | 2409.19215 | 2024-09-28 | cybersecurity |
1st Place Solution to the EPIC-Kitchens Action Anticipation Challenge 2022 | In this report, we describe the technical details of our submission to the EPIC-Kitchens Action Anticipation Challenge 2022. In this competition, we develop the following two approaches. 1) Anticipation Time Knowledge Distillation using the soft labels learned by the teacher model as knowledge to guide the student netw... | https://arxiv.org/abs/2207.05730v1 | 2207.05730 | 2022-07-10 | cybersecurity |
1st Place Solution to VisDA-2020: Bias Elimination for Domain Adaptive Pedestrian Re-identification | This paper presents our proposed methods for domain adaptive pedestrian re-identification (Re-ID) task in Visual Domain Adaptation Challenge (VisDA-2020). Considering the large gap between the source domain and target domain, we focused on solving two biases that influenced the performance on domain adaptive pedestrian... | https://arxiv.org/abs/2012.13498v1 | 2012.13498 | 2020-12-25 | cybersecurity |
1st Place Winner of the 2024 Pixel-level Video Understanding in the Wild (CVPR'24 PVUW) Challenge in Video Panoptic Segmentation and Best Long Video Consistency of Video Semantic Segmentation | The third Pixel-level Video Understanding in the Wild (PVUW CVPR 2024) challenge aims to advance the state of art in video understanding through benchmarking Video Panoptic Segmentation (VPS) and Video Semantic Segmentation (VSS) on challenging videos and scenes introduced in the large-scale Video Panoptic Segmentation... | https://arxiv.org/abs/2406.05352v1 | 2406.05352 | 2024-06-08 | cybersecurity |
$1$-String $B_1$-VPG Representations of Planar Partial $3$-Trees and Some Subclasses | Planar partial $3$-trees are subgraphs of those planar graphs obtained by
repeatedly inserting a vertex of degree $3$ into a face. In this paper, we show
that planar partial $3$-trees have $1$-string $B_1$-VPG representations, i.e.,
representations where every vertex is represented by an orthogonal curve with
at most o... | http://arxiv.org/abs/1506.07246v1 | 1506.07246 | 2015-06-24 | cybersecurity |
1st Solution Places for CVPR 2023 UG$^2$+ Challenge Track 2.2-Coded Target Restoration through Atmospheric Turbulence | In this technical report, we briefly introduce the solution of our team VIELab-HUST for coded target restoration through atmospheric turbulence in CVPR 2023 UG$^2$+ Track 2.2. In this task, we propose an efficient multi-stage framework to restore a high quality image from distorted frames. Specifically, each distorted ... | https://arxiv.org/abs/2306.09379v1 | 2306.09379 | 2023-06-15 | cybersecurity |
1st Solution Places for CVPR 2023 UG$^{\textbf{2}}$+ Challenge Track 2.1-Text Recognition through Atmospheric Turbulence | In this technical report, we present the solution developed by our team VIELab-HUST for text recognition through atmospheric turbulence in Track 2.1 of the CVPR 2023 UG$^{2}$+ challenge. Our solution involves an efficient multi-stage framework that restores a high-quality image from distorted frames. Specifically, a fr... | https://arxiv.org/abs/2306.08963v1 | 2306.08963 | 2023-06-15 | cybersecurity |
1st Workshop on Maritime Computer Vision (MaCVi) 2023: Challenge Results | The 1$^{\text{st}}$ Workshop on Maritime Computer Vision (MaCVi) 2023 focused on maritime computer vision for Unmanned Aerial Vehicles (UAV) and Unmanned Surface Vehicle (USV), and organized several subchallenges in this domain: (i) UAV-based Maritime Object Detection, (ii) UAV-based Maritime Object Tracking, (iii) USV... | https://arxiv.org/abs/2211.13508v2 | 2211.13508 | 2022-11-24 | cybersecurity |
1-subdivisions, fractional chromatic number and Hall ratio | The Hall ratio of a graph G is the maximum of |V(H)|/alpha(H) over all
subgraphs H of G. Clearly, the Hall ratio of a graph is a lower bound for the
fractional chromatic number. It has been asked whether conversely, the
fractional chromatic number is upper bounded by a function of the Hall ratio.
We answer this questio... | http://arxiv.org/abs/1812.07327v2 | 1812.07327 | 2020-01-30 | cybersecurity |
1 Tbit/s/$λ$ Transmission Over a 130 km Link Consisting of Graded-Index 50 $μ$m Core Multi-Mode Fiber and 6LP Few-Mode Fiber | We demonstrate 1 Tbit/s/$\lambda$ single-span transmission over a heterogeneous link consisting of graded-index 50 $\mu$m core multi-mode fiber and 6LP few-mode fiber using a Kramers-Kronig receiver structure. Furthermore, the link budget increase by transmitting only three modes while employing more than three receive... | https://arxiv.org/abs/2010.15498v1 | 2010.15498 | 2020-10-29 | cybersecurity |
1-Tb/s/λ Transmission over Record 10714-km AR-HCF | We present the first single-channel 1.001-Tb/s DP-36QAM-PCS recirculating transmission over 73 loops of 146.77-km ultra-low-loss & low-IMI DNANF-5 fiber, achieving a record transmission distance of 10,714.28 km. | https://arxiv.org/abs/2503.24313v2 | 2503.24313 | 2025-03-31 | cybersecurity |
1T-FeS$_2$$:$ a new type of two-dimensional metallic ferromagnet | Discovery of intrinsic two-dimensional (2D) magnetic materials is crucial for understanding the fundamentals of 2D magnetism and realizing next-generation magnetoelectronic and magneto-optical devices. Although significant efforts have been devoted to identifying 2D magnetism by exfoliating bulk magnetic layered materi... | https://arxiv.org/abs/2202.00252v1 | 2202.00252 | 2022-02-01 | cybersecurity |
[1]Title: $Υ$ and $η_b$ mass shifts in nuclear matter and the $^{12}$C nucleus bound states, [2]Title: $Υ$ and $η_b$ mass shifts in nuclear matter and the nucleus bound states | [1]Abstract: This is a contribution for the PANIC 2021 Proceedings based on the articles, Eur. Phys. J. A 57, 259 (2021) and the accompanied article $[$arXiv:2109.08636 $[$hep-ph$]]$ (Hadron 2021 contribution). We have estimated for the first time the mass shifts of the $\Upsilon$ and $\eta_b$ mesons in symmetric nucle... | https://arxiv.org/abs/2109.08636v2 | 2109.08636 | 2021-09-17 | cybersecurity |
1-to-1 or 1-to-n? Investigating the effect of function inlining on binary similarity analysis | Binary similarity analysis is critical to many code-reuse-related issues and "1-to-1" mechanism is widely applied, where one function in a binary file is matched against one function in a source file or binary file. However, we discover that function mapping is a more complex problem of "1-to-n" or even "n-to-n" due to... | https://arxiv.org/abs/2112.12928v2 | 2112.12928 | 2021-12-24 | cybersecurity |
1 to 2.4 micron Near-IR spectrum of the Giant Planet $\beta$ Pictoris b obtained with the Gemini Planet Imager | Using the Gemini Planet Imager (GPI) located at Gemini South, we measured the
near-infrared (1.0-2.4 micron) spectrum of the planetary companion to the
nearby, young star $\beta$ Pictoris. We compare the spectrum obtained with
currently published model grids and with known substellar objects and present
the best matchi... | http://arxiv.org/abs/1703.00011v1 | 1703.00011 | 2017-02-28 | cybersecurity |
\$1 Today or \$2 Tomorrow? The Answer is in Your Facebook Likes | In economics and psychology, delay discounting is often used to characterize
how individuals choose between a smaller immediate reward and a larger delayed
reward. People with higher delay discounting rate (DDR) often choose smaller
but more immediate rewards (a "today person"). In contrast, people with a lower
discoun... | http://arxiv.org/abs/1703.07726v3 | 1703.07726 | 2017-03-22 | cybersecurity |
1 Trillion Token (1TT) Platform: A Novel Framework for Efficient Data Sharing and Compensation in Large Language Models | In this paper, we propose the 1 Trillion Token Platform (1TT Platform), a novel framework designed to facilitate efficient data sharing with a transparent and equitable profit-sharing mechanism. The platform fosters collaboration between data contributors, who provide otherwise non-disclosed datasets, and a data consum... | https://arxiv.org/abs/2409.20149v1 | 2409.20149 | 2024-09-30 | cybersecurity |
1-Uryson width and covers | We investigate the following question: Do there exist Riemannian polyhedra $X$ such that the 1-Uryson width of their universal covers $\mathrm{UW}_1(\widetilde{X})$ is bounded but $\mathrm{UW}_1(X)$ is arbitrarily large? We rule out two specific cases: when $\pi_1(X)$ is virtually cyclic and when $X$ is a Riemannian su... | https://arxiv.org/abs/2505.21126v1 | 2505.21126 | 2025-05-27 | cybersecurity |
$(1+\varepsilon)$-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension | We consider the $(1+\varepsilon)$-Approximate Nearest Neighbour (ANN) Problem for polygonal curves in $d$-dimensional space under the Fr\'echet distance and ask to what extent known data structures for doubling spaces can be applied to this problem. Initially, this approach does not seem viable, since the doubling dime... | https://arxiv.org/abs/2307.08521v1 | 2307.08521 | 2023-07-17 | cybersecurity |
$(1 + \varepsilon)$-class Classification: an Anomaly Detection Method for Highly Imbalanced or Incomplete Data Sets | Anomaly detection is not an easy problem since distribution of anomalous samples is unknown a priori. We explore a novel method that gives a trade-off possibility between one-class and two-class approaches, and leads to a better performance on anomaly detection problems with small or non-representative anomalous sample... | https://arxiv.org/abs/1906.06096v1 | 1906.06096 | 2019-06-14 | cybersecurity |
$1/\varphi$ Spectrum of the Stress Dynamics with the Bak-Tang-Wiesenfeld Sandpile | With the original Bak-Tang-Wisenefeld (BTW) sandpile we uncover the $1/\varphi$ noise in the mechanism maintaining self-organized criticality (SOC) - the question raised together with the concept of SOC. We posit that the dynamics of stress in the BTW sandpile follows quasi-cycles of graduate stress accumulation that e... | https://arxiv.org/abs/2212.14726v3 | 2212.14726 | 2022-12-30 | cybersecurity |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.