Travelled to:
1 × China
1 × France
1 × Greece
1 × Korea
3 × USA
Collaborated with:
M.K.Mohania R.Kaushik H.Gupta P.Roy ∅ V.Pandit S.Roy R.Ramakrishnan Y.Sabharwal J.Cai J.F.Naughton P.Awasthi
Talks about:
complex (3) document (2) approxim (2) result (2) effici (2) decis (2) tree (2) algorithm (1) techniqu (1) structur (1)
Person: Venkatesan T. Chakaravarthy
DBLP: Chakaravarthy:Venkatesan_T=
Contributed to:
Wrote 7 papers:
- ICALP-v1-2009-ChakaravarthyPRS #approximate #branch #multi
- Approximating Decision Trees with Multiway Branches (VTC, VP, SR, YS), pp. 210–221.
- CIKM-2008-ChakaravarthyGRM #documentation #performance
- Efficient techniques for document sanitization (VTC, HG, PR, MKM), pp. 843–852.
- PODS-2007-ChakaravarthyPRAM #algorithm #approximate #identification
- Decision trees for entity identification: approximation algorithms and hardness results (VTC, VP, SR, PA, MKM), pp. 53–62.
- VLDB-2006-ChakaravarthyGRM #documentation
- Efficiently Linking Text Documents with Relevant Structured Information (VTC, HG, PR, MKM), pp. 667–678.
- PODS-2004-KaushikRC #optimisation #perspective #query
- Synopses for Query Optimization: A Space-Complexity Perspective (RK, RR, VTC), pp. 201–209.
- POPL-2003-Chakaravarthy #analysis #complexity
- New results on the computability and complexity of points — to analysis (VTC), pp. 115–125.
- PODS-2001-CaiCKN #complexity #on the
- On the Complexity of Join Predicates (JyC, VTC, RK, JFN).