Results 111 to 120 of about 6,986 (292)
K-Subspaces Quantization for Approximate Nearest Neighbor Search
Approximate Nearest Neighbor (ANN) search has become a popular approach for performing fast and efficient retrieval on very large-scale datasets in recent years, as the size and dimension of data grow continuously. In this paper, we propose a novel vector quantization method for ANN search which enables faster and more accurate retrieval on publicly ...
Ezgi Can Ozan +2 more
openaire +3 more sources
Inverse Design of Amorphous Materials With Targeted Properties
AMDEN is a diffusion model framework for the inverse design of amorphous materials with targeted properties. By incorporating Hamiltonian Monte Carlo refinement into the denoising process, the framework overcomes the challenge of generating thermally relaxed disordered structures.
Jonas A. Finkler +4 more
wiley +1 more source
Educational video platforms host vast collections of long, speech-centric lectures, yet most search interfaces remain metadata-driven and return results at the video level, making it difficult for learners—especially non-English speakers—to
Lazim Afraz +3 more
doaj +1 more source
Resonant Domain Wall Dynamics in a Three‐Dimensional Magnetic Nano Double Helix
3D magnetic nanostructures promise exciting possibilities for magnetization dynamics. However, experimental realizations remain scarce. In nanoprinted cobalt double helices, time‐resolved X‐ray microscopy reveals harmonic domain wall dynamics. Simulations identify the mode and additional higher‐frequency resonances, revealing a rich dynamic landscape ...
Pamela Morales‐Fernández +15 more
wiley +1 more source
Terminal Embeddings in Sublinear Time [PDF]
Recently (Elkin, Filtser, Neiman 2017) introduced the concept of a {\it terminal embedding} from one metric space $(X,d_X)$ to another $(Y,d_Y)$ with a set of designated terminals $T\subset X$. Such an embedding $f$ is said to have distortion $\rho\ge 1$
Yeshwanth Cherapanamjeri, Jelani Nelson
doaj +1 more source
Revisiting kd-tree for Nearest Neighbor Search
Click on the DOI link to access the article (may not be free).kd-tree [16] has long been deemed unsuitable for exact nearest-neighbor search in high dimensional data.
Parikshit Ram +3 more
core +1 more source
Emergent Spin Supersolids in Frustrated Quantum Materials
This review highlights developments in the study of spin super‐solids in frustrated quantum materials. Advanced experimental characterizations and computational studies enable a comprehensive understanding of the driving mechanisms of spin super‐solidity in various layered transition‐metal compounds, bridging materials, experiments, and theory aspects.
Yixuan Huang +2 more
wiley +1 more source
KScaNN: Scalable Approximate Nearest Neighbor Search on Kunpeng
Approximate Nearest Neighbor Search (ANNS) is a cornerstone algorithm for information retrieval, recommendation systems, and machine learning applications. While x86-based architectures have historically dominated this domain, the increasing adoption of ARM-based servers in industry presents a critical need for ANNS solutions optimized on ARM ...
Oleg Senkevich +15 more
openaire +2 more sources
ABSTRACT Accurately knowing the frontier orbital energies of the structurally disordered small‐molecule organic semiconductors that are used in optoelectronic devices such as organic light‐emitting diodes is required to rationally improve their performance. Here, we show that these energies can be deduced with a large accuracy from the peak energies of
Christian B. McDonald +7 more
wiley +1 more source
This paper explores the integration of Large Language Models (LLMs) and secure Gen-AI technologies within engineering design and manufacturing, with a focus on improving inventory management, component selection, and recommendation workflows.
Dulana Rupanetti +5 more
doaj +1 more source

