default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNilesh N. Dalvi
Person information
- affiliation: Troo.ly
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[r3]Nilesh N. Dalvi:
Uncertainty Management in Scientific Database Systems. Encyclopedia of Database Systems (2nd ed.) 2018- [r2]Nilesh N. Dalvi, Dan Olteanu:
Query Processing over Uncertain Data. Encyclopedia of Database Systems (2nd ed.) 2018 - 2015
- [j17]Norases Vesdapunt, Kedar Bellare, Nilesh N. Dalvi:
Errata for "Crowdsourcing Algorithms for Entity Resolution" (PVLDB 7(12): 1071-1082). Proc. VLDB Endow. 8(5): 641 (2015) - 2014
- [j16]Norases Vesdapunt, Kedar Bellare, Nilesh N. Dalvi:
Crowdsourcing Algorithms for Entity Resolution. Proc. VLDB Endow. 7(12): 1071-1082 (2014) - [j15]Z. Meral Özsoyoglu, Ugur Çetintemel, Nilesh N. Dalvi, Hank Korth, Anthony K. H. Tung
:
Special issue on best papers of VLDB 2012. VLDB J. 23(2): 173-174 (2014) - [c30]Flavio Chierichetti, Nilesh N. Dalvi, Ravi Kumar:
Correlation clustering in MapReduce. KDD 2014: 641-650 - [c29]Nilesh N. Dalvi, Marian Olteanu, Manish Raghavan, Philip Bohannon:
Deduplicating a places database. WWW 2014: 409-418 - 2013
- [c28]Aditya Pal, Nilesh N. Dalvi, Kedar Bellare:
Discovering Hierarchical Structure for Sources and Entities. AAAI 2013: 753-759 - [c27]Nilesh N. Dalvi, Ravi Kumar, Bo Pang:
Para 'Normal' Activity: On the Distribution of Average Ratings. ICWSM 2013 - [c26]Nilesh N. Dalvi, Anirban Dasgupta, Ravi Kumar, Vibhor Rastogi:
Aggregating crowdsourced binary ratings. WWW 2013: 285-294 - [c25]Nilesh N. Dalvi, Vibhor Rastogi, Anirban Dasgupta, Anish Das Sarma, Tamás Sarlós:
Optimal hashing schemes for entity matching. WWW 2013: 295-306 - 2012
- [j14]Nilesh N. Dalvi, Dan Suciu:
The dichotomy of probabilistic inference for unions of conjunctive queries. J. ACM 59(6): 30:1-30:87 (2012) - [j13]Nilesh N. Dalvi, Ashwin Machanavajjhala, Bo Pang:
An Analysis of Structured Data on the Web. Proc. VLDB Endow. 5(7): 680-691 (2012) - [j12]Ugur Çetintemel, Nilesh N. Dalvi:
Letter from the Associate Editors. Proc. VLDB Endow. 5(8): i-vii (2012) - [c24]Nilesh N. Dalvi, Aditya G. Parameswaran, Vibhor Rastogi:
Minimizing Uncertainty in Pipelines. NIPS 2012: 2951-2959 - [c23]Philip Bohannon, Nilesh N. Dalvi, Yuval Filmus, Nori Jacoby, S. Sathiya Keerthi, Alok Kirpal:
Automatic web-scale information extraction. SIGMOD Conference 2012: 609-612 - [c22]Nilesh N. Dalvi, Ravi Kumar, Bo Pang:
Object matching in tweets with spatial models. WSDM 2012: 43-52 - [i4]Nilesh N. Dalvi, Ashwin Machanavajjhala, Bo Pang:
An Analysis of Structured Data on the Web. CoRR abs/1203.6406 (2012) - 2011
- [j11]Nilesh N. Dalvi, Christopher Ré, Dan Suciu:
Queries and materialized views on probabilistic databases. J. Comput. Syst. Sci. 77(3): 473-490 (2011) - [j10]Vibhor Rastogi, Nilesh N. Dalvi, Minos N. Garofalakis:
Large-Scale Collective Entity Matching. Proc. VLDB Endow. 4(4): 208-218 (2011) - [j9]Nilesh N. Dalvi, Ravi Kumar, Mohamed A. Soliman:
Automatic Wrappers for Large Scale Web Extraction. Proc. VLDB Endow. 4(4): 219-230 (2011) - [j8]Aditya G. Parameswaran, Nilesh N. Dalvi, Hector Garcia-Molina, Rajeev Rastogi:
Optimal Schemes for Robust Web Extraction. Proc. VLDB Endow. 4(11): 980-991 (2011) - [j7]Nilesh N. Dalvi:
Letter from the Associate Editor. Proc. VLDB Endow. 5(4) (2011) - [c21]Nilesh N. Dalvi, Ravi Kumar, Ashwin Machanavajjhala, Vibhor Rastogi:
Sampling hidden objects using nearest-neighbor oracles. KDD 2011: 1325-1333 - [c20]Lorenzo Blanco, Nilesh N. Dalvi, Ashwin Machanavajjhala:
Highly efficient algorithms for structural clustering of large websites. WWW 2011: 437-446 - [i3]Nilesh N. Dalvi, Ravi Kumar, Mohamed A. Soliman:
Automatic Wrappers for Large Scale Web Extraction. CoRR abs/1103.2406 (2011) - [i2]Vibhor Rastogi, Nilesh N. Dalvi, Minos N. Garofalakis:
Large-Scale Collective Entity Matching. CoRR abs/1103.2410 (2011) - 2010
- [c19]Nilesh N. Dalvi, Karl Schnaitter, Dan Suciu:
Computing query probability with incidence algebras. PODS 2010: 203-214
2000 – 2009
- 2009
- [j6]Nilesh N. Dalvi, Christopher Ré, Dan Suciu:
Probabilistic databases: diamonds in the dirt. Commun. ACM 52(7): 86-94 (2009) - [j5]Nilesh N. Dalvi:
Query Evaluation on a Database Given by a Random Graph. Theory Comput. Syst. 44(4): 503-532 (2009) - [c18]Nilesh N. Dalvi, Ravi Kumar, Bo Pang, Andrew Tomkins:
A translation model for matching reviews to objects. CIKM 2009: 167-176 - [c17]Nilesh N. Dalvi, Ravi Kumar, Bo Pang, Andrew Tomkins:
Matching Reviews to Objects using a Language Model. EMNLP 2009: 609-618 - [c16]Nilesh N. Dalvi, Ravi Kumar, Bo Pang, Raghu Ramakrishnan, Andrew Tomkins, Philip Bohannon, S. Sathiya Keerthi, Srujana Merugu:
A web of concepts. PODS 2009: 1-12 - [c15]Nilesh N. Dalvi, Philip Bohannon, Fei Sha:
Robust web extraction: an approach based on a probabilistic tree-edit model. SIGMOD Conference 2009: 335-348 - [r1]Nilesh N. Dalvi:
Uncertainty Management in Scientific Database Systems. Encyclopedia of Database Systems 2009: 3225-3231 - 2007
- [j4]Nilesh N. Dalvi, Dan Suciu:
Efficient query evaluation on probabilistic databases. VLDB J. 16(4): 523-544 (2007) - [c14]Christopher Ré, Nilesh N. Dalvi, Dan Suciu:
Efficient Top-k Query Evaluation on Probabilistic Data. ICDE 2007: 886-895 - [c13]Nilesh N. Dalvi:
Query Evaluation on a Database Given by a Random Graph. ICDT 2007: 149-163 - [c12]Nilesh N. Dalvi, Dan Suciu:
Management of probabilistic data: foundations and challenges. PODS 2007: 1-12 - [c11]Nilesh N. Dalvi, Dan Suciu:
The dichotomy of conjunctive queries on probabilistic structures. PODS 2007: 293-302 - [c10]Brenton Louie, Landon Detwiler, Nilesh N. Dalvi, Ron Shaker, Peter Tarczy-Hornoch, Dan Suciu:
Incorporating Uncertainty Metrics into a General-Purpose Data Integration System. SSDBM 2007: 19 - 2006
- [j3]Christopher Ré, Nilesh N. Dalvi, Dan Suciu:
Query Evaluation on Probabilistic Databases. IEEE Data Eng. Bull. 29(1): 25-31 (2006) - [c9]Surajit Chaudhuri, Nilesh N. Dalvi, Raghav Kaushik:
Robust Cardinality and Cost Estimation for Skyline Operator. ICDE 2006: 64 - [i1]Nilesh N. Dalvi, Dan Suciu:
The Dichotomy of Conjunctive Queries on Probabilistic Structures. CoRR abs/cs/0612102 (2006) - 2005
- [c8]Nilesh N. Dalvi, Gerome Miklau, Dan Suciu:
Asymptotic Conditional Probabilities for Conjunctive Queries. ICDT 2005: 289-305 - [c7]Jihad Boulos, Nilesh N. Dalvi, Bhushan Mandhani, Shobhit Mathur, Christopher Ré, Dan Suciu:
MYSTIQ: a system for finding more answers by using probabilities. SIGMOD Conference 2005: 891-893 - [c6]Dan Suciu, Nilesh N. Dalvi:
Foundations of probabilistic answers to queries. SIGMOD Conference 2005: 963 - [c5]Nilesh N. Dalvi, Dan Suciu:
Answering Queries from Statistics and Probabilistic Views. VLDB 2005: 805-816 - 2004
- [c4]Nilesh N. Dalvi, Pedro M. Domingos, Mausam, Sumit K. Sanghai, Deepak Verma:
Adversarial classification. KDD 2004: 99-108 - [c3]Nilesh N. Dalvi, Dan Suciu:
Efficient Query Evaluation on Probabilistic Databases. VLDB 2004: 864-875 - 2003
- [j2]Nilesh N. Dalvi, Sumit K. Sanghai, Prasan Roy, S. Sudarshan:
Pipelining in multi-query optimization. J. Comput. Syst. Sci. 66(4): 728-762 (2003) - [j1]Igor Tatarinov, Zachary G. Ives, Jayant Madhavan, Alon Y. Halevy, Dan Suciu, Nilesh N. Dalvi, Xin Dong, Yana Kadiyska, Gerome Miklau, Peter Mork:
The Piazza peer data management project. SIGMOD Rec. 32(3): 47-52 (2003) - 2001
- [c2]Nilesh N. Dalvi, Sumit K. Sanghai, Prasan Roy, S. Sudarshan:
Pipelining in Multi-Query Optimization. PODS 2001 - [c1]Naga Kiran, Sudhir P. Mudur, Sharat Chandran, Nilesh N. Dalvi:
Anti-aliased Hemicubes for Performance Improvements in Radiosity Solutions. WSCG 2001: 336-343
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
