An efficient central path algorithm for virtual navigation parag chaudhuri, rohit khandekar, deepak sethi, prem kalra thesis a framework for view- dependent character animation parag chaudhuri phd thesis, 2006 department of computer science and engineering, iit delhi [thesis homepage]. Title of dissertation: directed graphs: fixed-parameter tractability and beyond advisor: prof mohammadtaghi larry s davis doctoral dissertation award for phd thesis from university of maryland • college of computer taghi hajiaghayi, rohit khandekar, guy kortsarz and saeed seddighin 6 parameterized. Abstract we formulate bandwidth maximization problems in multicasting streaming data multicasting is used to stream data to many terminals simultaneously the goal here is to maximize the bandwidth at which the data can be transmitted satisfying the capacity constraints on the links a typical network consists of the. Ron adany, moran feldman, elad haramaty, rohit khandekar, baruch schieber, roy schwartz, hadas shachnai and tami tamir, 16th conference on integer programming and combinatorial optimization (ipco 2013) a tight linear time ( 1/2)-approximation for unconstrained submodular maximization niv buchbinder. [gk04] naveen garg and rohit khandekar fractional covering with upper bounds on the variables: solving lps with negative entries in esa, pages 371– 382, 2004 [kha04] rohit khandekar lagrangian relaxation based algorithms for convex pro- gramming problems phd thesis, indian institute of technology, delhi. This is to certify that the thesis titled “local search heuristics for facility location problems” being submitted by towards him secondly, rohit khandekar, my colleague for last four years rohit got deeply in- volved in my research and i have thoroughly enjoyed working with him on many different problems his clarity of.
M hirzel, h andrade, buğra gedik, gabriela jacques-silva, rohit khandekar, vibhore kumar, mark mendell, howard nasgaard, scott schneider “scaling continuous queries for future computing platforms and applications”, phd thesis, college of computing, georgia institute of technology, 2006. In the papers [ahk05b, trw05], for instance, and is explained in detail in the phd thesis of s kale [kal07] this general method captures many previously rithm of rohit khandekar and the first author (rahul jain) that approximates equilibrium points of classical games in the sections that follow, we give. Quick links conference workshop book chap tech reports thesis patents code data fast nearest neighbor search on large time-evolving graphs pdf -file-icon [slides] leman akoglu, rohit khandekar, vibhore kumar, srinivasan parthasarathy, deepak rajan, kun-lung wu ecml/pkdd, nancy, france, sep 2014. Rohit khandekar, baruch schieber, hadas shachnai and tami tamir khandekar et al 171 as intervals on the real line, each representing the time interval in which a job should be processed each job has to be processed on some machine, and thesis, dept of computer science, univ of wisconsin - madison, 1995.
Local search heuristics for k-median and facility location problems v arya, n garg, r khandekar, a meyerson, k munagala, v pandit siam journal on computing 33 (3), 544-562, 2004 756, 2004 flex: a slot allocation scheduling optimizer for mapreduce workloads j wolf, d rajan, k hildrum, r khandekar, v kumar,. Lisa fleischer , rahul garg , sanjiv kapoor , rohit khandekar , amin saberi, a fast and simple algorithm for computing market equilibria rohit khandekhar 2004 langrangian relaxation based algorithms for convex programming problems technical report phd thesis, indian institute of. 296 block-sparse solutions using kernel block rip and its application to group lasso rahul garg rohit khandekar ibm tj watson research center [email protected] usibmcom ibm tj watson research center [email protected] abstract we propose kernel block restricted isome- try property (kb-rip) as a generalization.
I am a fourth year phd student in department of computer science at university of maryland working under supervision of mohammad t hajiaghayi i got my m sc degree from university of alberta working with mohammad r salavatipour i did my undergraduate studies in computer engineering at amirkabir university of. Mit press, cambridge, massachusetts, 1994  rohit khandekar lagrangian relaxation based algorithms for convex program- ming problems phd thesis, iit delhi, 2004  philip klein and hsueh i lu efficient approximation algorithms for semidefinite programs arising from max cut and coloring. In this dissertation, we study the design of approximation algorithms that yield strong our first result exploits the cut-matching game of khandekar, rao and vazirani , an el- egant framework we recommend the survey paper  and the theses of rohit khandekar  and satyen kale  for the.
Thesis title likely date of comple tion 1 giselle maria fernandes nst125 biology ncbs sumantra chattarji biol-298a 09/07/2012 the influence of early life 85 rohit sharma rsa320 physics ncra divya oberoi phys-266 03/02 /2015 a study of the sun at low radio frequencies 2017 86 himanshu srivastava. Vd zwaan (2013-2014), rohit khandekar (two year post-doc at ibm) 2006-2008 (now at knight capital) thesis committees (excluding own students): • phd committees: salvatore ingala, 2017, idsia (advisor: farizio grandoni), christos kalaitzis, 2017 epfl (advisor: ola svensson), ilan reuven cohen, 2016, tel aviv.
Thesis title: reusable software infrastructure for stream processing 2006 msc in thesis title: ensuring content integrity for untrusted peer-to-peer content distribution networks 1999 martin hirzel, henrique andrade, bu˘gra gedik, gabriela jacques da silva, rohit khandekar, vibhor kumar, mark mendell, howard. Optimization of other set and sequence functions lin chen, moran feldman and amin karbasi: weakly submodular maximization beyond cardinality constraints: does randomization help greedy submitted marko mitrovic, moran feldman, andreas krause and amin karbasi: submodularity on hypergraph: from sets.