Остановите войну!
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 412 matches
- 2009
- Prateek Jain, Brian Kulis, Jason V. Davis, Inderjit S. Dhillon:
Metric and Kernel Learning using a Linear Transformation. CoRR abs/0910.5932 (2009) - Rafig Agaev, Pavel Chebotarev:
Which Digraphs with Ring Structure are Essentially Cyclic? CoRR abs/0910.3113 (2009) - José Bento, Andrea Montanari:
Which graphical models are difficult to learn? CoRR abs/0910.5761 (2009) - Bernhard G. Bodmann, Peter G. Casazza, Gitta Kutyniok:
A quantitative notion of redundancy for finite frames. CoRR abs/0910.5904 (2009) - Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin:
The positive semidefinite Grothendieck problem with rank constraint. CoRR abs/0910.5765 (2009) - Jean-Loup Carre, Charles Hymans:
From Single-thread to Multithreaded: An Efficient Static Analysis Algorithm. CoRR abs/0910.5833 (2009) - L. Sunil Chandran, Rajesh Chitnis, Ramanjit Kumar:
On the SIG dimension of trees under $L_{\infty}$ metric. CoRR abs/0910.5380 (2009) - Luigi Cimmino:
Shor's Algorithm from the Mindset of Quantum Oracles. CoRR abs/0910.0287 (2009) - Christos Dimitrakakis, Aikaterini Mitrokotsa:
Statistical Decision Making for Authentication and Intrusion Detection. CoRR abs/0910.0483 (2009) - Daoyi Dong, Ian R. Petersen:
Quantum control theory and applications: A survey. CoRR abs/0910.2350 (2009) - Florian Dörfler, Francesco Bullo:
Synchronization and Transient Stability in Power Networks and Non-Uniform Kuramoto Oscillators. CoRR abs/0910.5673 (2009) - Lucie Galand, Olivier Spanjaard:
Exact algorithms for OWA-optimization in multiobjective spanning tree problems. CoRR abs/0910.5744 (2009) - Steve Gregory:
Finding overlapping communities in networks by label propagation. CoRR abs/0910.5516 (2009) - Alexander K. Kelmans:
Packing 3-vertex paths in claw-free graphs and related topics. CoRR abs/0910.4681 (2009) - Jennifer Kloke, Gunnar Carlsson:
Topological De-Noising: Strengthening the Topological Signal. CoRR abs/0910.5947 (2009) - Slawomir Lasota, Marcin Poturalski:
Undecidability of performance equivalence of Petri nets. CoRR abs/0910.5819 (2009) - Giuseppe Notarstefano, Francesco Bullo:
Distributed Abstract Optimization via Constraints Consensus: Theory and Applications. CoRR abs/0910.5816 (2009) - David O'Callaghan, Louise Doran, Brian A. Coghlan:
Evaluating Trust in Grid Certificates. CoRR abs/0910.5920 (2009) - Anatoly Pashkevich, Damien Chablat, Philippe Wenger, Roman Gomolitsky:
Calibration of 3-d.o.f. Translational Parallel Manipulators Using Leg Observations. CoRR abs/0910.5794 (2009) - Dusko Pavlovic, Catherine Meadows:
Quantifying pervasive authentication: the case of the Hancke-Kuhn protocol. CoRR abs/0910.5745 (2009) - Federico Ramponi, Debasish Chatterjee, Sean Summers, John Lygeros:
On the connections between PCTL and Dynamic Programming. CoRR abs/0910.4738 (2009) - Garvesh Raskutti, Martin J. Wainwright, Bin Yu:
Minimax rates of estimation for high-dimensional linear regression over $\ell_q$-balls. CoRR abs/0910.2042 (2009) - Gunther Reißig:
Computing abstractions of nonlinear systems. CoRR abs/0910.2187 (2009) - Mahmoud Taherzadeh, H. Vincent Poor:
Limits on the Robustness of MIMO Joint Source-Channel Codes. CoRR abs/0910.5950 (2009) - Tony Tan:
On Pebble Automata for Data Languages with Decidable Emptiness Problem. CoRR abs/0910.5844 (2009) - Ravi Tandon, Sennur Ulukus, Kannan Ramchandran:
Secure Source Coding with a Helper. CoRR abs/0910.5759 (2009) - Gabriel H. Tucci, Maria V. Vega:
A Note on Functional Averages over Gaussian Ensembles. CoRR abs/0910.0575 (2009) - James M. Whitacre, Axel Bender:
Degeneracy: a link between evolvability, robustness and complexity in biological systems. CoRR abs/0910.2586 (2009) - Mikolás Janota, João Marques-Silva, Radu Grigore:
Algorithms for finding dispensable variables. CoRR abs/0910.0013 (2009) - Bruno Grenet:
Acceptable Complexity Measures of Theorems. CoRR abs/0910.0045 (2009)
skipping 382 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-04-17 01:09 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