• Publications
  • Influence
USING CAMERA-EQUIPPED MOBILE PHONES FOR INTERACTING WITH REAL-WORLD OBJECTS
TLDR
The idea is to use the built-in cameras of consumer mobile phones as sensors for 2-dimensional visual codes, which allows the simultaneous detection of multiple codes, introduces a position-independent coordinate system, and provides the phone’s orientation as a parameter.
Towards optimal range medians
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
TLDR
The algorithm shows that for computing a MIS, randomization is a viable alternative to distance information and is close to optimal.
Finding Longest Approximate Periodic Patterns
TLDR
An algorithm which approximates the longest periodic pattern present in the input in the following sense, and an approximate variant of the well-known 3SUM problem can also be solved in O(n1+γ + Tsort(n)) time, for any constant γ > 0, where Tsort (n) is the time required to sort n numbers.
Self-supervised audio representation learning for mobile devices
TLDR
The quality of the embeddings produced by the self-supervised learning models are evaluated, and it is shown that they can be re-used for a variety of downstream tasks, and for some tasks even approach the performance of fully supervised models of similar size.
Pre-Training Audio Representations With Self-Supervision
TLDR
This work proposes two self-supervised tasks: Audio2Vec, which aims at reconstructing a spectrogram slice from past and future slices and TemporalGap, which estimates the distance between two short audio segments extracted at random from the same audio clip.
One-Shot Conditional Audio Filtering of Arbitrary Sounds
We consider the problem of separating a particular sound source from a single-channel mixture, based on only a short sample of the target source (from the same recording). Using SoundFilter, a
A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs
TLDR
A distributed algorithm for finding a (1 + Ɛ)- approximation of a Minimum Connected Dominating Set in the class of Growth-Bounded graphs, which includes Unit Disk graphs, that guarantees a constant stretch factor on the length of a shortest path with respect to the original graph and induces a subgraph of constant degree.
Faster Swap Edge Computation in Minimum Diameter Spanning Trees
TLDR
This work solves the ABS problem in O(mlog n) time and O(m) space, thus considerably improving upon the decade-old previously best solution, which requires m=o(n2/log 2n).
...
...