default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 39 matches
- 2024
- Yuping Xing, Yongzhao Zhan:
Performance prediction of multivariable linear regression based on the optimal influencing factors for ranking aggregation in crowdsourcing task. Data Technol. Appl. 58(2): 176-200 (2024) - 2022
- Buchen Wu, Jiwei Qin:
A List-Ranking Framework Based on Linear and Non-Linear Fusion for Recommendation from Implicit Feedback. Entropy 24(6): 778 (2022) - 2021
- Dmitry Gromov, Elizaveta Evmenova:
On the Exponential Ranking and Its Linear Counterpart. COMPLEX NETWORKS 2021: 260-270 - 2020
- Yongxiang Zhou, Haifeng Yang, Jianghui Cai, Xujun Zhao, Yaling Xun, Caixia Qu:
WEDA: A Weak Emission-Line Detection Algorithm Based on the Weighted Ranking. IEEE Access 8: 97986-98000 (2020) - Yi Li, Wenyuan Wu, Yong Feng:
On ranking functions for single-path linear-constraint loops. Int. J. Softw. Tools Technol. Transf. 22(6): 655-666 (2020) - 2018
- Yi Li, Tianxun Cai, Wenyuan Wu:
基于k阶秩函数的线性赋值循环程序的终止性分析 (Termination Analysis of Linear Assignment Loop Program Based on k-ranking Functions). 计算机科学 45(6): 151-155 (2018) - T.-H. Hubert Chan, Fei Chen, Xiaowei Wu, Zhichao Zhao:
Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming. SIAM J. Comput. 47(4): 1529-1546 (2018) - 2017
- Ali Ebrahimnejad:
Cost parametric analysis of linear programming problems with fuzzy cost coefficients based on ranking functions. Int. J. Math. Model. Numer. Optimisation 8(1): 62-91 (2017) - Amir M. Ben-Amram, Samir Genaim:
On Multiphase-Linear Ranking Functions. CAV (2) 2017: 601-620 - Amir M. Ben-Amram, Samir Genaim:
On Multiphase-Linear Ranking Functions. CoRR abs/1703.07547 (2017) - 2016
- Daniel C. McDonald:
List rankings and on-line list rankings of graphs. Discret. Appl. Math. 205: 109-125 (2016) - Sukhpreet Kaur Sidhu, Amit Kumar:
A note on "Solving intuitionistic fuzzy linear programming problems by ranking function". J. Intell. Fuzzy Syst. 30(5): 2787-2790 (2016) - Paul-Stefan Popescu, Marian Cristian Mihaescu, Elvira Popescu, Mihai Mocanu:
Using Ranking and Multiple Linear Regression to Explore the Impact of Social Media Engagement on Student Performance. ICALT 2016: 250-254 - Fonenantsoa Maurica, Frédéric Mesnard, Étienne Payet:
On the Linear Ranking Problem for Simple Floating-Point Loops. SAS 2016: 300-316 - 2015
- Anthony Perez:
On the kernelization of ranking r-CSPs: Linear vertex-kernels for generalizations of Feedback Arc Set and Betweenness in tournaments. Discret. Appl. Math. 186: 214-225 (2015) - Ali Ebrahimnejad:
A duality approach for solving bounded linear programming problems with fuzzy variables based on ranking functions and its application in bounded transportation problems. Int. J. Syst. Sci. 46(11): 2048-2060 (2015) - Daniel C. McDonald:
On-Line Vertex Ranking of Trees. SIAM J. Discret. Math. 29(1): 145-156 (2015) - 2014
- Evanthia Faliagka, Lazaros S. Iliadis, Ioannis Karydis, Maria Rigou, Spyros Sioutas, Athanasios K. Tsakalidis, Giannis Tzimas:
On-line consistent ranking on e-recruitment: seeking the truth behind a well-formed CV. Artif. Intell. Rev. 42(3): 515-528 (2014) - 2013
- F. Javier Ortega:
Detection of dishonest behaviors in on-line networks using graph-based ranking techniques. AI Commun. 26(3): 327-329 (2013) - Piotr Borowiecki, Dariusz Dereniowski:
On-line ranking of split graphs. Discret. Math. Theor. Comput. Sci. 15(2): 195-214 (2013) - M. Venkata Kirthiga, Pramodkumar Muppiddi:
A case study for controlled islanding based on line contingency ranking in autonomous micro-grids. AFRICON 2013: 1-5 - Hiroyuki Sato, Danushka Bollegala, Yoshihiko Hasegawa, Hitoshi Iba:
Learning non-linear ranking functions for web search using probabilistic model building GP. IEEE Congress on Evolutionary Computation 2013: 3371-3378 - Amir M. Ben-Amram, Samir Genaim:
On the linear ranking problem for integer linear-constraint loops. POPL 2013: 51-62 - 2012
- Raju Balakrishnan:
Trust and Profit Sensitive Ranking for the Deep Web and On-line Advertisements. Arizona State University, Tempe, USA, 2012 - Amir M. Ben-Amram, Samir Genaim:
On the Linear Ranking Problem for Integer Linear-Constraint Loops. CoRR abs/1208.4041 (2012) - 2010
- Sebastián Peña Saldarriaga, Emmanuel Morin, Christian Viard-Gaudin:
Ranking Fusion Methods Applied to On-Line Handwriting Information Retrieval. ECIR 2010: 253-264 - 2009
- Chia-Wei Lee, Justie Su-tzu Juan, Tai-Lung Wu:
An On-Line Parallel Algorithm for Node Ranking of Trees. ICA3PP 2009: 384-395 - 2008
- Dowming Yeh, Ray J. Tsai, Pei-Chen Sun, Jia-Wen Lee:
Linear Regression Models for Assessing the Ranking of Web Sites Based on Average Numbers of Visits. J. Inf. Sci. Eng. 24(2): 585-599 (2008) - Bin Gu, Jiandong Wang, Haiyan Chen:
On-line off-line Ranking Support Vector Machine and analysis. IJCNN 2008: 1364-1369 - Jingyu Cui, Fang Wen, Xiaoou Tang:
IntentSearch: interactive on-line image search re-ranking. ACM Multimedia 2008: 997-998
skipping 9 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-22 07:14 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint