BibSLEIGH — Nilesh_N

Travelled to:

1 × Canada
1 × Norway
2 × China
9 × USA

Collaborated with:

D.Suciu R.Kumar B.Pang N.Vesdapunt K.Bellare P.Bohannon A.Machanavajjhala V.Rastogi S.K.Sanghai A.Tomkins F.Chierichetti M.A.Soliman M.N.Garofalakis K.Schnaitter F.Sha S.Keerthi A.G.Parameswaran H.Garcia-Molina R.Rastogi P.Roy S.Sudarshan P.M.Domingos Mausam D.Verma Y.Filmus N.Jacoby A.Kirpal J.Boulos B.Mandhani S.Mathur C.Ré R.Ramakrishnan S.Merugu

Talks about:

probabilist (6) queri (6) web (6) extract (4) entiti (3) answer (3) scale (3) crowdsourc (2) algorithm (2) structur (2)

Person: Nilesh N. Dalvi

DBLP: Dalvi:Nilesh_N=

Contributed to:

2015

2014

2012

2011

2010

2009

2007

2005

2004

2001

Wrote 21 papers:

VLDB-2015-VesdapuntBD #algorithm #crowdsourcing: Errata for “Crowdsourcing Algorithms for Entity Resolution” (PVLDB 7(12): 1071-1082) (NV, KB, NND), p. 641.
KDD-2014-ChierichettiDK #clustering #correlation #pipes and filters: Correlation clustering in MapReduce (FC, NND, RK), pp. 641–650.
VLDB-2014-VesdapuntBD #algorithm #crowdsourcing: Crowdsourcing Algorithms for Entity Resolution (NV, KB, NND), pp. 1071–1082.
SIGMOD-2012-BohannonDFJKK #automation #information management: Automatic web-scale information extraction (PB, NND, YF, NJ, SK, AK), pp. 609–612.
VLDB-2012-DalviMP #analysis #web: An Analysis of Structured Data on the Web (NND, AM, BP), pp. 680–691.
KDD-2011-DalviKMR #nearest neighbour #using: Sampling hidden objects using nearest-neighbor oracles (NND, RK, AM, VR), pp. 1325–1333.
VLDB-2011-DalviKS #automation #scalability #web: Automatic Wrappers for Large Scale Web Extraction (NND, RK, MAS), pp. 219–230.
VLDB-2011-ParameswaranDGR #robust #web: Optimal Schemes for Robust Web Extraction (AGP, NND, HGM, RR), pp. 980–991.
VLDB-2011-RastogiDG #scalability: Large-Scale Collective Entity Matching (VR, NND, MNG), pp. 208–218.
PODS-2010-DalviSS #algebra #probability #query: Computing query probability with incidence algebras (NND, KS, DS), pp. 203–214.
CIKM-2009-DalviKPT: A translation model for matching reviews to objects (NND, RK, BP, AT), pp. 167–176.
PODS-2009-DalviKPRTBKM #concept #web: A web of concepts (NND, RK, BP, RR, AT, PB, SK, SM), pp. 1–12.
SIGMOD-2009-DalviBS #approach #probability #robust #web: Robust web extraction: an approach based on a probabilistic tree-edit model (NND, PB, FS), pp. 335–348.
PODS-2007-DalviS #challenge #probability: Management of probabilistic data: foundations and challenges (NND, DS), pp. 1–12.
PODS-2007-DalviS07a #probability #query: The dichotomy of conjunctive queries on probabilistic structures (NND, DS), pp. 293–302.
SIGMOD-2005-BoulosDMMRS #named #using: MYSTIQ: a system for finding more answers by using probabilities (JB, NND, BM, SM, CR, DS), pp. 891–893.
SIGMOD-2005-SuciuD #probability #query: Foundations of probabilistic answers to queries (DS, NND), p. 963.
VLDB-2005-DalviS #probability #query #statistics: Answering Queries from Statistics and Probabilistic Views (NND, DS), pp. 805–816.
KDD-2004-DalviDMSV #classification: Adversarial classification (NND, PMD, M, SKS, DV), pp. 99–108.
VLDB-2004-DalviS #database #evaluation #performance #probability #query: Efficient Query Evaluation on Probabilistic Databases (NND, DS), pp. 864–875.
PODS-2001-DalviSRS #multi #optimisation #pipes and filters: Pipelining in Multi-Query Optimization (NND, SKS, PR, SS).