Остановите войну!
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 178 matches
- 2011
- Panagiotis Achlioptas, Bernhard Schölkopf, Karsten M. Borgwardt:
Two-locus association mapping in subquadratic time. KDD 2011: 726-734 - Deepak Agarwal, Bee-Chung Chen, Pradheep Elango, Xuanhui Wang:
Click shaping to optimize multiple objectives. KDD 2011: 132-140 - Deepak Agarwal, Bee-Chung Chen, Bo Long:
Localized factor models for multi-context recommendation. KDD 2011: 609-617 - Charu C. Aggarwal, Yan Xie, Philip S. Yu:
On dynamic data-driven selection of sensor streams. KDD 2011: 1226-1234 - Rakesh Agrawal, Samuel Ieong, Raja Velu:
Ameliorating buyer's remorse. KDD 2011: 351-359 - Amr Ahmed, Yucheng Low, Mohamed Aly, Vanja Josifovski, Alexander J. Smola:
Scalable distributed inference of dynamic user interests for behavioral targeting. KDD 2011: 114-122 - Faris Alqadah, Raj Bhatnagar:
A game theoretic framework for heterogenous information network clustering. KDD 2011: 795-804 - David Andrzejewski, David Buttler:
Latent topic feedback for information retrieval. KDD 2011: 600-608 - Kazuo Aoyama, Kazumi Saito, Hiroshi Sawada, Naonori Ueda:
Fast approximate similarity search based on degree-reduced neighborhood graphs. KDD 2011: 1055-1063 - David L. Applegate, Tamraparni Dasu, Shankar Krishnan, Simon Urbanek:
Unsupervised clustering of multidimensional distributions using earth mover distance. KDD 2011: 636-644 - Josh Attenberg, Foster J. Provost:
Online active inference and learning. KDD 2011: 186-194 - Gustavo E. A. P. A. Batista, Eamonn J. Keogh, Agenor Mafra-Neto, Edgar Rowton:
SIGKDD demo: sensors and software to allow computational entomology, an emerging application of data mining. KDD 2011: 761-764 - Ron Bekkerman, Matan Gavish:
High-precision phrase-based document classification on a modern scale. KDD 2011: 231-239 - Kanishka Bhaduri, Bryan L. Matthews, Chris Giannella:
Algorithms for speeding up distance-based outlier detection. KDD 2011: 859-867 - Tijl De Bie:
An information theoretic framework for data mining. KDD 2011: 564-572 - Albert Bifet, Geoff Holmes, Bernhard Pfahringer, Ricard Gavaldà:
Mining frequent closed graphs on evolving data streams. KDD 2011: 591-599 - Mikhail Bilenko, Matthew Richardson:
Predictive client-side profiles for personalized advertising. KDD 2011: 413-421 - Richard Boire:
The practitioner's viewpoint to data mining: key lessons learned in the trenches and case studies. KDD 2011: 785 - Mario Boley, Claudio Lucchese, Daniel Paurat, Thomas Gärtner:
Direct local pattern sampling by efficient two-step random procedures. KDD 2011: 582-590 - Stephen P. Boyd:
Convex optimization: from embedded real-time to large-scale distributed. KDD 2011: 1 - Michael Brückner, Tobias Scheffer:
Stackelberg games for adversarial prediction problems. KDD 2011: 547-555 - Dean Cerrato, Rosie Jones, Avinash Gupta:
Classification of proxy labeled examples for marketing segment generation. KDD 2011: 343-350 - Sagar Chaki, Cory F. Cohen, Arie Gurfinkel:
Supervised learning for provenance-similarity of binaries. KDD 2011: 15-23 - Kai-Wei Chang, Dan Roth:
Selective block minimization for faster convergence of limited memory large-scale linear models. KDD 2011: 699-707 - Rita Chattopadhyay, Jieping Ye, Sethuraman Panchanathan, Wei Fan, Ian Davidson:
Multi-source domain adaptation and its application to early detection of fatigue. KDD 2011: 717-725 - Duen Horng Chau, Aniket Kittur, Jason I. Hong, Christos Faloutsos:
Apolo: interactive large graph sensemaking by combining machine learning and visualization. KDD 2011: 739-742 - Ye Chen, Pavel Berkhin, Bo Anderson, Nikhil R. Devanur:
Real-time bidding algorithms for performance-based display ad allocation. KDD 2011: 1307-1315 - Feng Chen, Jing Dai, Bingsheng Wang, Sambit Sahu, Milind R. Naphade, Chang-Tien Lu:
Activity analysis based on low sample rate smart meters. KDD 2011: 240-248 - Bee-Chung Chen, Jian Guo, Belle L. Tseng, Jie Yang:
User reputation in a comment rating environment. KDD 2011: 159-167 - Feilong Chen, Supranamaya Ranjan, Pang-Ning Tan:
Detecting bots via incremental LS-SVM learning with dynamic feature adaptation. KDD 2011: 386-394
skipping 148 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-25 15:58 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