Остановите войну!
for scientists:
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 34 matches
- 2000
- Ilya Nemenman, William Bialek:
Occam factors and model-independent Bayesian learning of continuous distributions. CoRR cond-mat/0009165 (2000) - Martin Weigt, Alexander K. Hartmann:
Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs. CoRR cond-mat/0009417 (2000) - Christof Monz:
Computing Presuppositions by Contextual Reasoning. CoRR cs.AI/0009019 (2000) - John Watrous:
Succinct quantum proofs for properties of finite groups. CoRR cs.CC/0009002 (2000) - Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian:
Pattern Matching for sets of segments. CoRR cs.CG/0009013 (2000) - Marshall W. Bern, David Eppstein:
Computing the Depth of a Flat. CoRR cs.CG/0009024 (2000) - Anoop Sarkar, Daniel Zeman:
Automatic Extraction of Subcategorization Frames for Czech. CoRR cs.CL/0009003 (2000) - Erik F. Tjong Kim Sang, Sabine Buchholz:
Introduction to the CoNLL-2000 Shared Task: Chunking. CoRR cs.CL/0009008 (2000) - Ion Androutsopoulos, Georgios Paliouras, Vangelis Karkaletsis, Georgios Sakkis, Constantine D. Spyropoulos, Panagiotis Stamatopoulos:
Learning to Filter Spam E-Mail: A Comparison of a Naive Bayesian and a Memory-Based Approach. CoRR cs.CL/0009009 (2000) - Masaki Murata:
Anaphora Resolution in Japanese Sentences Using Surface Expressions and Examples. CoRR cs.CL/0009011 (2000) - Christof Monz:
Modeling Ambiguity in a Multi-Agent System. CoRR cs.CL/0009012 (2000) - Marco Aiello, Christof Monz, Leon Todoran:
Combining Linguistic and Spatial Information for Document Analysis. CoRR cs.CL/0009014 (2000) - Christof Monz, Maarten de Rijke:
A Tableaux Calculus for Ambiguous Quantification. CoRR cs.CL/0009015 (2000) - Christof Monz:
Contextual Inference in Computational Semantics. CoRR cs.CL/0009016 (2000) - Christof Monz, Maarten de Rijke:
A Tableau Calculus for Pronoun Resolution. CoRR cs.CL/0009017 (2000) - Christof Monz, Maarten de Rijke:
A Resolution Calculus for Dynamic Semantics. CoRR cs.CL/0009018 (2000) - Gerard Escudero, Lluís Màrquez, German Rigau:
A Comparison between Supervised Learning Algorithms for Word Sense Disambiguation. CoRR cs.CL/0009022 (2000) - Rens Bod:
Parsing with the Shortest Derivation. CoRR cs.CL/0009025 (2000) - Rens Bod:
An improved parser for data-oriented lexical-functional analysis. CoRR cs.CL/0009026 (2000) - Yair Even-Zohar, Dan Roth:
A Classification Approach to Word Prediction. CoRR cs.CL/0009027 (2000) - Mark Baker, Rajkumar Buyya, Daniel C. Hyde:
Cluster Computing: A High-Performance Contender. CoRR cs.DC/0009020 (2000) - Rajkumar Buyya, David Abramson, Jonathan Giddy:
Nimrod/G: An Architecture of a Resource Management and Scheduling System in a Global Computational Grid. CoRR cs.DC/0009021 (2000) - Les Carr, Steve Hitchcock, Wendy Hall, Stevan Harnad:
A usage based analysis of CoRR. CoRR cs.DL/0009004 (2000) - Alex Brodsky, Stephane Durocher, Ellen Gethner:
The Rectilinear Crossing Number of K_10 is 62. CoRR cs.DM/0009023 (2000) - Alex Brodsky, Stephane Durocher, Ellen Gethner:
Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics. CoRR cs.DM/0009028 (2000) - David Eppstein, Joseph Wang:
Fast Approximation of Centrality. CoRR cs.DS/0009005 (2000) - David Eppstein:
Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction. CoRR cs.DS/0009006 (2000) - Martin Grohe:
Computing Crossing Numbers in Quadratic Time. CoRR cs.DS/0009010 (2000) - Andrei N. Soklakov:
Complexity analysis for algorithmically simple strings. CoRR cs.LG/0009001 (2000) - Foster J. Provost, Tom Fawcett:
Robust Classification for Imprecise Environments. CoRR cs.LG/0009007 (2000)
skipping 4 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-05-28 12:19 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