default search action
Parvaz Mahdabi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j4]Maryam Habibi, Parvaz Mahdabi, Andrei Popescu-Belis
:
Question answering in conversations: Query refinement using contextual and semantic information. Data Knowl. Eng. 106: 38-51 (2016) - [c13]Parvaz Mahdabi, Andrei Popescu-Belis
Comparing Two Strategies for Query Expansion in a News Monitoring System. NLDB 2016: 267-275 - 2015
- [c12]Wolfgang Tannebaum, Parvaz Mahdabi, Andreas Rauber:
Effect of Log-Based Query Term Expansion on Retrieval Effectiveness in Patent Searching. CLEF 2015: 300-305 - 2014
- [j3]Parvaz Mahdabi, Fabio Crestani
The effect of citation analysis on query expansion for patent retrieval. Inf. Retr. 17(5-6): 412-429 (2014) - [j2]Parvaz Mahdabi, Fabio Crestani
Patent Query Formulation by Synthesizing Multiple Sources of Relevance Evidence. ACM Trans. Inf. Syst. 32(4): 16:1-16:30 (2014) - [c11]Parvaz Mahdabi, Fabio Crestani
Query-Driven Mining of Citation Networks for Patent Citation Retrieval and Recommendation. CIKM 2014: 1659-1668 - 2013
- [c10]Linda Andersson, Parvaz Mahdabi, Allan Hanbury, Andreas Rauber:
Exploring Patent Passage Retrieval Using Nouns Phrases. ECIR 2013: 676-679 - [c9]Parvaz Mahdabi, Shima Gerani, Jimmy Xiangji Huang
Leveraging conceptual lexicon: query disambiguation using proximity information for patent retrieval. SIGIR 2013: 113-122 - 2012
- [c8]Linda Andersson, Parvaz Mahdabi, Allan Hanbury, Andreas Rauber:
Report on the CLEF-IP 2012 Experiments: Exploring Passage Retrieval with the PIPExtractor. CLEF (Online Working Notes/Labs/Workshop) 2012 - [c7]Parvaz Mahdabi, Fabio Crestani
Learning-Based Pseudo-Relevance Feedback for Patent Retrieval. IRFC 2012: 1-11 - [c6]Parvaz Mahdabi, Linda Andersson, Mostafa Keikha, Fabio Crestani
Automatic refinement of patent queries using concept importance predictors. SIGIR 2012: 505-514 - 2011
- [j1]Roberto Montemanni
A Linear Programming-based Evolutionary Algorithm for the Minimum Power Broadcast Problem in Wireless Sensor Networks. J. Math. Model. Algorithms 10(2): 145-162 (2011) - [c5]Parvaz Mahdabi, Linda Andersson, Allan Hanbury, Fabio Crestani:
Report on the CLEF-IP 2011 Experiments: Exploring Patent Summarization. CLEF (Notebook Papers/Labs/Workshop) 2011 - [c4]Parvaz Mahdabi, Mostafa Keikha, Shima Gerani, Monica Landoni, Fabio Crestani
Building Queries for Prior-Art Search. IRFC 2011: 3-15 - 2010
- [c3]Mostafa Keikha, Parvaz Mahdabi, Shima Gerani, Giacomo Inches, Javier Parapar, Mark James Carman, Fabio Crestani:
University of Lugano at TREC 2010. TREC 2010
2000 – 2009
- 2009
- [c2]Parvaz Mahdabi, Mahdi Abadi
A novel quantum-inspired evolutionary algorithm for solving combinatorial optimization problems. GECCO 2009: 1807-1808 - 2008
- [c1]Parvaz Mahdabi, Saeed Jalili, Mahdi Abadi:
A multi-start quantum-inspired evolutionary algorithm for solving combinatorial optimization problems. GECCO 2008: 613-614
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-04-24 23:03 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: