4,261 results for efficient · 0.251s

Sponsored Partners
github.com/mlhpdx/seekable-s3-stream

mlhpdx/seekable-s3-stream

Code library that uses S3's API to provide an efficient random-access (seekable) Stream implementation for use in code where efficient network I/O is paramount. (⭐ 43)

arxiv.org/abs/2602.09373v1

AfriNLLB: Efficient Translation Models for African Languages

In this work, we present AfriNLLB, a series of lightweight models for efficient translation from and into African languages. AfriNLLB supports 15 language pairs (30 translation directions), including Swahili, Hausa, Yoruba, Amharic, Somali, Zulu, Lin...

arxiv.org/abs/2003.03961v1

BiDet: An Efficient Binarized Object Detector

In this paper, we propose a binarized neural network learning method called BiDet for efficient object detection. Conventional network binarization methods directly quantize the weights and activations in one-stage or two-stage detectors with constra...

en.wikipedia.org/wiki/Voice_leading

Voice leading - Wikipedia

by efficient voice leadings. Clearly, to satisfy these constraints, a composer must be able to find the efficient voice leadings between arbitrary chords

arxiv.org/abs/2504.00072v1

Chapter-Llama: Efficient Chaptering in Hour-Long Videos with LLMs

We address the task of video chaptering, i.e., partitioning a long video timeline into semantic units and generating corresponding chapter titles. While relatively underexplored, automatic chaptering has the potential to enable efficient navigation a...

github.com/ajz34/Kennard-Stone-Efficient

ajz34/Kennard-Stone-Efficient

Efficiently implemented Kennard-Stone sampling algorithms for quite large datasets (⭐ 5)

arxiv.org/abs/1412.4181v2

Oriented Edge Forests for Boundary Detection

We present a simple, efficient model for learning boundary detection based on a random forest classifier. Our approach combines (1) efficient clustering of training examples based on simple partitioning of the space of local edge orientations and (2)...

arxiv.org/abs/2505.03763v1

Splitwiser: Efficient LM inference with constrained resources

Efficient inference of LLMs remains a crucial challenge, with two main phases: a compute-intensive prompt computation and a memory-intensive token generation. Despite existing batching and scheduling techniques, token generation phases fail to fully...

www.reddit.com/r/askscience/comments/260om5/is_skipping_more_efficient_than_running_or_walking

Is skipping more efficient than running or walking?

What is the most efficient way for the human body to transport itself without using any artificial enhancements?...

arxiv.org/abs/2406.06248v1

Compute Better Spent: Replacing Dense Layers with Structured Matrices

Dense linear layers are the dominant computational bottleneck in foundation models. Identifying more efficient alternatives to dense matrices has enormous potential for building more compute-efficient models, as exemplified by the success of convolut...

arxiv.org/abs/2401.06761v1

APAR: LLMs Can Do Auto-Parallel Auto-Regressive Decoding

The massive adoption of large language models (LLMs) demands efficient deployment strategies. However, the auto-regressive decoding process, which is fundamental to how most LLMs generate text, poses challenges to achieve efficient serving. In this w...

arxiv.org/abs/1201.5478v2

On the Actual Inefficiency of Efficient Negotiation Methods

In this contribution we analyze the effect that mutual information has on the actual performance of efficient negotiation methods. Specifically, we start by proposing the theoretical notion of Abstract Negotiation Method (ANM) as a map from the negot...

stackoverflow.com/questions/68074457/efficient-modulo-255-computation

Efficient modulo-255 computation

Tags: c, algorithm, assembly, bit-manipulation, micro-optimization | Score: 20

arxiv.org/abs/2412.16331v2

Efficient points in a sum of sets of alternatives

The concept of efficiency plays a prominent role in the formal solution of decision problems that involve incomparable alternatives. This paper develops necessary and sufficient conditions for the efficient points in a sum of sets of alternatives to...

arxiv.org/abs/1702.00109v1

Info-Clustering: An Efficient Algorithm by Network Information Flow

Motivated by the fact that entities in a social network or biological system often interact by exchanging information, we propose an efficient info-clustering algorithm that can group entities into communities using a parametric max-flow algorithm. T...

arxiv.org/abs/1401.2327v1

BPP: Large Graph Storage for Efficient Disk Based Processing

Processing very large graphs like social networks, biological and chemical compounds is a challenging task. Distributed graph processing systems process the billion-scale graphs efficiently but incur overheads of efficient partitioning and distributi...

news.mit.edu/2024/mit-researchers-develop-efficiency-training-more-reliable-ai-agents-1122

MIT researchers develop an efficient way to train more reliable AI ...

Nov 22, 2024 · MIT researchers developed an efficient approach for training more reliable reinforcement learning models, focusing on complex tasks that involve variability. This could enable the leverage of …

arxiv.org/abs/1308.0652v3

Efficient immunization strategies to prevent financial contagion

Many immunization strategies have been proposed to prevent infectious viruses from spreading through a network. In this study, we propose efficient immunization strategies to prevent a default contagion that might occur in a financial network. An ess...