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
Exact 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 23 matches
- 2024
- Mattia Fumagalli, Tiago Prince Sales, Pedro Paulo F. Barcelos, Giovanni Micale, Vadim Zaytsev, Diego Calvanese, Giancarlo Guizzardi:
Mining Frequent Structures in Conceptual Models. CoRR abs/2406.07129 (2024) - 2023
- Mini Prince, P. M. Joe Prathap:
An Imbalanced Dataset and Class Overlapping Classification Model for Big Data. Comput. Syst. Sci. Eng. 44(2): 1009-1024 (2023) - Thomas Derave, Lander Maes, Tiago Prince Sales, Frederik Gailly, Geert Poels:
One Model to Rule Them All - A Demonstration of Ontology-Driven Minimum Viable Product Development for a Local Tourism Platform. ER (Workshops) 2023: 230-241 - 2022
- Thomas Derave, Tiago Prince Sales, Frederik Gailly, Geert Poels:
A Method for Ontology-Driven Minimum Viable Platform Development. BPMDS/EMMSAD@CAiSE 2022: 253-266 - Mattia Fumagalli, Tiago Prince Sales, Giancarlo Guizzardi:
Pattern Discovery in Conceptual Models Using Frequent Itemset Mining. ER 2022: 52-62 - 2020
- Cyril Zhang:
Regret-Minimizing Algorithms Beyond Classical Optimization and Control. Princeton University, USA, 2020 - Serena Y. Kim, Koushik Ganesan, Princess Dickens, Soumya Panda:
Public Sentiment Toward Solar Energy: Opinion Mining of Twitter Using a Transformer-Based Language Model. CoRR abs/2007.13306 (2020) - 2017
- Prince Singh, Min Chen, Luca Carlone, Sertac Karaman, Emilio Frazzoli, David Hsu:
Supermodular mean squared error minimization for sensor scheduling in optimal Kalman Filtering. ACC 2017: 5787-5794 - 2016
- Shahram Rasoolzadeh, Håvard Raddum:
Cryptanalysis of PRINCE with Minimal Data. AFRICACRYPT 2016: 109-126 - Shahram Rasoolzadeh, Håvard Raddum:
Cryptanalysis of PRINCE with Minimal Data. IACR Cryptol. ePrint Arch. 2016: 80 (2016) - 2014
- Nicolas Béchet, Jacques Chauché, Violaine Prince, Mathieu Roche:
How to combine text-mining methods to validate induced Verb-Object relations? Comput. Sci. Inf. Syst. 11(1): 133-155 (2014) - James M. Widmann, Brian P. Self, Michael J. Prince:
Mini-workshop - Inquiry based learning activities: Hands on activities to improve conceptual understanding. FIE 2014: 1-2 - Guillaume Tisserant, Mathieu Roche, Violaine Prince:
Mining Tweet Data - Statistic and Semantic Information for Political Tweet Classification. KDIR 2014: 523-529 - 2013
- Ronny Mans, Hajo A. Reijers, Hans Berends, Wasana Bandara, Rogier Prince:
Business Process Mining Success. ECIS 2013: 89 - 2012
- Sahar Soleimanifard, Michael Schär, Allison G. Hays, Robert G. Weiss, Matthias Stuber, Jerry L. Prince:
Vessel centerline tracking and boundary segmentation in coronary MRA with minimal manual interaction. ISBI 2012: 1417-1420 - 2011
- Eric Keller:
Refactoring Router Software to Minimize Disruption. Princeton University, USA, 2011 - Prince Mahajan, Srinath T. V. Setty, Sangmin Lee, Allen Clement, Lorenzo Alvisi, Michael Dahlin, Michael Walfish:
Depot: Cloud Storage with Minimal Trust. ACM Trans. Comput. Syst. 29(4): 12:1-12:38 (2011) - Andrew J. Asman, Andrew G. Scoggins, Jerry L. Prince, Bennett A. Landman:
Foibles, follies, and fusion: assessment of statistical label fusion techniques for web-based collaborations using minimal training. Medical Imaging: Image Processing 2011: 79623G - 2010
- Mathieu Roche, Violaine Prince:
A Web-Mining Approach to Disambiguate Biomedical Acronym Expansions. Informatica (Slovenia) 34(2): 243-253 (2010) - Prince Mahajan, Srinath T. V. Setty, Sangmin Lee, Allen Clement, Lorenzo Alvisi, Michael Dahlin, Michael Walfish:
Depot: Cloud Storage with Minimal Trust. OSDI 2010: 307-322 - 2009
- József Balogh, Noah Prince:
Minimum Difference Representations of Graphs. Graphs Comb. 25(5): 647-655 (2009) - 2008
- Mathieu Roche, Violaine Prince:
Managing the Acronym/Expansion Identification Process for Text-Mining Applications. Int. J. Softw. Informatics 2(2): 163-179 (2008) - 1994
- John Princen, Ming H. Chan:
Minimum generalised quadratic error quantisation for image and video coding. ICASSP (5) 1994: 249-252
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-10-17 14:56 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