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 49 matches
- 2002
- Jens Christian Claussen:
Generalized Winner-Relaxing Kohonen Self-Organizing Feature Maps. CoRR cond-mat/0208414 (2002) - Roberto Mulet, Andrea Pagnani, Martin Weigt, Riccardo Zecchina:
Coloring random graphs. CoRR cond-mat/0208460 (2002) - Attila Fekete, M. Marodi, Gábor Vattay:
On the Prospects of Chaos Aware Traffic Modeling. CoRR cond-mat/0208488 (2002) - Yves Moinard:
Linking Makinson and Kraus-Lehmann-Magidor preferential entailments. CoRR cs.AI/0208017 (2002) - Mikalai Birukou:
Knowledge Representation. CoRR cs.AI/0208019 (2002) - Joseph Y. Halpern, Judea Pearl:
Causes and Explanations: A Structural-Model Approach. Part II: Explanations. CoRR cs.AI/0208034 (2002) - Carlos Gershenson:
Classification of Random Boolean Networks. CoRR cs.CC/0208001 (2002) - Hartmut Klauck:
Rectangle Size Bounds and Threshold Covers in Communication Complexity. CoRR cs.CC/0208006 (2002) - Charles Sauerbier:
Mathematical basis for polySAT implication operator. CoRR cs.CC/0208026 (2002) - John M. Hitchcock:
Gales Suffice for Constructive Dimension. CoRR cs.CC/0208043 (2002) - Stephen A. Fenner:
Gales and supergales are equivalent for defining constructive Hausdorff dimension. CoRR cs.CC/0208044 (2002) - Wen Chen:
A note on fractional derivative modeling of broadband frequency-dependent absorption: Model III. CoRR cs.CE/0208016 (2002) - Boris Kovalerchuk, Evgenii Vityaev, H. Yusupov:
Symbolic Methodology in Numeric Data Mining: Relational Techniques for Financial Applications. CoRR cs.CE/0208022 (2002) - Wen Chen:
A direct time-domain FEM modeling of broadband frequency-dependent absorption with the presence of matrix fractional power: Model I. CoRR cs.CE/0208030 (2002) - Alex Verstak, Naren Ramakrishnan, Kyung Kyoon Bae, William H. Tranter, Layne T. Watson, Jian He, Clifford A. Shaffer, Theodore S. Rappaport:
Using Hierarchical Data Mining to Characterize Performance of Wireless System Configurations. CoRR cs.CE/0208040 (2002) - Masaki Murata, Hitoshi Isahara:
Using the DIFF Command for Natural Language Processing. CoRR cs.CL/0208020 (2002) - Andrei Popescu-Belis, Isabelle Robba:
Evaluation of Coreference Rules on Complex Narrative Texts. CoRR cs.CL/0208035 (2002) - Andrei Popescu-Belis, Isabelle Robba:
Three New Methods for Evaluating Reference Resolution. CoRR cs.CL/0208036 (2002) - Andrei Popescu-Belis, Isabelle Robba:
Cooperation between Pronoun and Reference Resolution for Unrestricted Texts. CoRR cs.CL/0208037 (2002) - Andrei Popescu-Belis, Isabelle Robba, Gérard Sabah:
Reference Resolution Beyond Coreference: a Conceptual Frame and its Application. CoRR cs.CL/0208038 (2002) - A. Lavrenov:
Theoretical limit of the compression for the information. CoRR cs.CR/0208002 (2002) - A. Lavrenov:
MV2-algorithm's clones. CoRR cs.CR/0208003 (2002) - Kamil Kulesza, Zbigniew Kotulski:
On the graph coloring check-digit scheme with applications to verifiable secret sharing. CoRR cs.CR/0208007 (2002) - Joseph Y. Halpern, Ron van der Meyden:
A logical reconstruction of SPKI. CoRR cs.CR/0208028 (2002) - Yvo Desmedt, Yongge Wang:
Perfectly Secure Message Transmission Revisited. CoRR cs.CR/0208041 (2002) - Ulrich Hillenbrand, Gerd Hirzinger:
Probabilistic Search for Object Segmentation and Recognition. CoRR cs.CV/0208005 (2002) - Alexander S. Szalay, Jim Gray, Jan vandenBerg:
Petabyte Scale Data Mining: Dream or Reality? CoRR cs.DB/0208013 (2002) - Alexander S. Szalay, Tamas Budavari, Andrew J. Connolly, Jim Gray, Takahiko Matsubara, Adrian Pope, Istvan Szapudi:
Spatial Clustering of Galaxies in Large Datasets. CoRR cs.DB/0208015 (2002) - Alexander S. Szalay, Tamas Budavari, Tanu Malik, Jim Gray, Ani Thakar:
Web Services for the Virtual Observatory. CoRR cs.DC/0208014 (2002) - Gregory Allen Kohring:
Implicit Simulations using Messaging Protocols. CoRR cs.DC/0208021 (2002)
skipping 19 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-11-27 02:55 CET 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