Zobrazeno 1 - 10
of 276
pro vyhledávání: '"Sen, Sandeep"'
Autor:
Boyane, Swapnil S.1 (AUTHOR), Sen, Sandeep2 (AUTHOR), Priyadarsanan, Dharma Rajan1 (AUTHOR) priyan@atree.org, Thunga, Pavan Kumar1 (AUTHOR), Joshi, Nikhil U.1 (AUTHOR), Ghate, Hemant V.3 (AUTHOR)
Publikováno v:
PLoS ONE. 7/31/2024, Vol. 19 Issue 7, p1-42. 42p.
Publikováno v:
FSTTCS 2021
In this paper, we study the problem of designing prefix-free encoding schemes having minimum average code length that can be decoded efficiently under a decode cost model that captures memory hierarchy induced cost functions. We also study a special
Externí odkaz:
http://arxiv.org/abs/2010.05005
Autor:
Sen, Sandeep
By combining several interesting applications of random sampling in geometric algorithms like point location, linear programming, segment intersections, binary space partitioning, Clarkson and Shor \cite{CS89} developed a general framework of randomi
Externí odkaz:
http://arxiv.org/abs/1808.02356
In this paper, we focus on lower bounds and algorithms for some basic geometric problems in the one-pass (insertion only) streaming model. The problems considered are grouped into three categories: (i) Klee's measure (ii) Convex body approximation, g
Externí odkaz:
http://arxiv.org/abs/1803.06875
We consider a variant of the knapsack problem, where items are available with different possible weights. Using a separate budget for these item improvements, the question is: Which items should be improved to which degree such that the resulting cla
Externí odkaz:
http://arxiv.org/abs/1607.08338
Autor:
Pratap, Rameshwar, Sen, Sandeep
In this work, we present a randomized coreset construction for projective clustering, which involves computing a set of $k$ closest $j$-dimensional linear (affine) subspaces of a given set of $n$ vectors in $d$ dimensions. Let $A \in \mathbb{R}^{n\ti
Externí odkaz:
http://arxiv.org/abs/1606.07992
Autor:
Madan, Dhiraj, Sen, Sandeep
We develop new techniques for rounding packing integer programs using iterative randomized rounding. It is based on a novel application of multidimensional Brownian motion in $\mathbb{R}^n$. Let $\overset{\sim}{x} \in {[0,1]}^n$ be a fractional feasi
Externí odkaz:
http://arxiv.org/abs/1507.08501
Autor:
Saharoy, Debjyoti, Sen, Sandeep
We study budget constrained network upgradeable problems. We are given an undirected edge weighted graph $G=(V,E)$ where the weight an edge $e \in E$ can be upgraded for a cost $c(e)$. Given a budget $B$ for improvement, the goal is to find a subset
Externí odkaz:
http://arxiv.org/abs/1412.3721
Autor:
Sen, Sandeep
We describe a novel algorithm for rounding packing integer programs based on multidimensional Brownian motion in $\mathbb{R}^n$. Starting from an optimal fractional feasible solution $\bar{x}$, the procedure converges in polynomial time to a distribu
Externí odkaz:
http://arxiv.org/abs/1408.0488