Results 171 to 180 of about 5,409,269 (206)

A model of mobile robots in networks with resolvability properties. [PDF]

open access: yesPLoS One
Camacho Campos C   +4 more
europepmc   +1 more source

SIGMA++: Improved Semantic-Complete Graph Matching for Domain Adaptive Object Detection

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2023
Domain Adaptive Object Detection (DAOD) generalizes the object detector from an annotated domain to a label-free novel one. Recent works estimate prototypes (class centers) and minimize the corresponding distances to adapt the cross-domain class ...
Wuyang Li, Xinyu Liu, Yixuan Yuan
semanticscholar   +1 more source

Empty Triangles in Good Drawings of the Complete Graph

Graphs Comb., 2013
A good drawing of a simple graph is a drawing on the sphere or, equivalently, in the plane in which vertices are drawn as distinct points, edges are drawn as Jordan arcs connecting their end vertices, and any pair of edges intersects at most once. In any
O. Aichholzer   +5 more
semanticscholar   +1 more source

Short Paths for First Passage Percolation on the Complete Graph

, 2012
We study the complete graph equipped with a topology induced by independent and identically distributed edge weights. The focus of our analysis is on the weight Wn and the number of edges Hn of the minimal weight path between two distinct vertices in the
M. Eckhoff   +3 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy