We explore the prospects for bounding the weak scale using the weak gravity conjecture (WGC), addressing the hierarchy problem by violating the expectations of effective field theory. Building on earlier work by Cheung and Remmen, we construct models...
A new algorithm is proposed which accelerates the mini-batch k-means algorithm of Sculley (2010) by using the distance bounding approach of Elkan (2003). We argue that, when incorporating distance bounds into a mini-batch algorithm, already used data...
During training, supervised object detection tries to correctly match the predicted bounding boxes and associated classification scores to the ground truth. This is essential to determine which predictions are to be pushed towards which solutions, or...
In this paper, we propose a object detection method expressed as rotated bounding box to solve grasping challenge in the scenes where rigid objects and soft objects are mixed together. Compared with traditional detection methods, this method can outp...
Spatial relation reasoning is a crucial task for multimodal large language models (MLLMs) to understand the objective world. However, current benchmarks have issues like relying on bounding boxes, ignoring perspective substitutions, or allowing quest...
Localizing people and recognizing their actions from videos is a challenging task towards high-level video understanding. Existing methods are mostly two-stage based, with one stage for person bounding box generation and the other stage for action re...
Zero-shot detection, namely, localizing both seen and unseen objects, increasingly gains importance for large-scale applications, with large number of object classes, since, collecting sufficient annotated data with ground truth bounding boxes is sim...
Manually annotating object bounding boxes is central to building computer vision datasets, and it is very time consuming (annotating ILSVRC [53] took 35s for one high-quality box [62]). It involves clicking on imaginary corners of a tight box around...
Deterministic dynamics is a mathematical model used to describe the temporal evolution of a system, generally expressed as dx/dt = F(x), where x represents the system's state, and F(x) determines its dynamics. It is employed to understand long-term s...
The instance segmentation can be considered an extension of the object detection problem where bounding boxes are replaced by object contours. Strictly speaking the problem requires to identify each pixel instance and class independently of the artif...
A library for prototyping realtime hand detection (bounding box), directly in the browser. (⭐ 2921)
King, Lu, and Peng recently proved that for $Δ\geq 4$, any $K_Δ$-free graph with maximum degree $Δ$ has fractional chromatic number at most $Δ-\tfrac{2}{67}$ unless it is isomorphic to $C_5\boxtimes K_2$ or $C_8^2$. Using a different approach we...
We present a method for learning treewidth-bounded Bayesian networks from data sets containing thousands of variables. Bounding the treewidth of a Bayesian greatly reduces the complexity of inferences. Yet, being a global property of the graph, it co...
Starting from an inaccessible cardinal, we construct a model of $ZF+DC$ where there exists a mad family and all sets of reals are $\mathbb Q$-measurable for $ω^ω$-bounding sufficiently absolute forcing notions $\mathbb Q$....
We continue the work of Braun and Floystad, and Cook bounding the degree of smooth surfaces in P4 not of general type using generic initial ideal theory....
One of the recent trends in vision problems is to use natural language captions to describe the objects of interest. This approach can overcome some limitations of traditional methods that rely on bounding boxes or category annotations. This paper in...
In this work, we present a novel method for combining predictions of object detection models: weighted boxes fusion. Our algorithm utilizes confidence scores of all proposed bounding boxes to constructs the averaged boxes. We tested method on several...
Recently the notion of $k$-rainbow total domination was introduced for a graph $G$, motivated by a desire to reduce the problem of computing the total domination number of the generalized prism $G \Box K_k$ to an integer labeling problem on $G$. In t...
Text detection enables us to extract rich information from images. In this paper, we focus on how to generate bounding boxes that are appropriate to grasp text areas on books to help implement automatic text detection. We attempt not to improve a lea...
Any bounding compact smooth manifold bounds a compact manifold with a spine consisting of transversely intersecting codimension one submanifolds. This paper provides details for a picture proof given in previous papers with S. Akbulut....