Остановите войну!
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 99 matches
- 2012
- Charu C. Aggarwal:
The Multi-Set Stream Clustering Problem. SDM 2012: 59-69 - Charu C. Aggarwal, Shuyang Lin, Philip S. Yu:
On Influential Node Discovery in Dynamic Social Networks. SDM 2012: 636-647 - Charu C. Aggarwal, Karthik Subbian:
Event Detection in Social Streams. SDM 2012: 624-635 - Charu C. Aggarwal, Yan Xie, Philip S. Yu:
On Dynamic Link Inference in Heterogeneous Networks. SDM 2012: 415-426 - Leman Akoglu, Hanghang Tong, Brendan Meeder, Christos Faloutsos:
PICS: Parameter-free Identification of Cohesive Subgroups in Large Attributed Graphs. SDM 2012: 439-450 - Faris Alqadah, Joel S. Bader, Rajul Anand, Chandan K. Reddy:
Query-based Biclustering using Formal Concept Analysis. SDM 2012: 648-659 - Anthony J. Bagnall, Luke M. Davis, Jon Hills, Jason Lines:
Transformation Based Ensembles for Time Series Classification. SDM 2012: 307-318 - Mohammad Taha Bahadori, Yan Liu:
Granger Causality Analysis in Irregular Time Series. SDM 2012: 660-671 - Xue Bai, Zezhen Lin, Yun Xiong, Yangyong Zhu:
Clustering Based on Yukawa Potential. SDM 2012: 672-683 - Nicola Barbieri, Giuseppe Manco, Riccardo Ortale, Ettore Ritacco:
Balancing Prediction and Recommendation Accuracy: Hierarchical Latent Factors for Preference Data. SDM 2012: 1035-1046 - Nicola Barile, Ad Feelders:
Active Learning with Monotonicity Constraints. SDM 2012: 756-767 - Mustafa Bilgic:
Combining Active Learning and Dynamic Dimensionality Reduction. SDM 2012: 696-707 - Samuel J. Blasiak, Huzefa Rangwala, Kathryn B. Laskey:
Beam Methods for the Profile Hidden Markov Model. SDM 2012: 331-342 - Soumyadeep Chatterjee, Karsten Steinhaeuser, Arindam Banerjee, Snigdhansu Chatterjee, Auroop R. Ganguly:
Sparse Group Lasso: Consistency and Climate Applications. SDM 2012: 47-58 - Xi Chen, Jingrui He, Rick Lawrence, Jaime G. Carbonell:
Adaptive Multi-task Sparse Learning with an Application to fMRI Study. SDM 2012: 212-223 - Jidong Chen, Wentao Wu, Hang Guo, Wei Wang:
Context-aware Search for Personal Information Management Systems. SDM 2012: 708-719 - Jaegul Choo, Shawn Bohn, Grant Nakamura, Amanda M. White, Haesun Park:
Heterogeneous Data Fusion via Space Alignment Using Nonmetric Multidimensional Scaling. SDM 2012: 177-188 - Freddy Chong Tat Chua, Hady Wirawan Lauw, Ee-Peng Lim:
Mining Social Dependencies in Dynamic Interaction Networks. SDM 2012: 720-731 - Boris Cule, Nikolaj Tatti, Bart Goethals:
MARBLES: Mining Association Rules Buried in Long Event Sequences. SDM 2012: 248-259 - Bing Tian Dai, Freddy Chong Tat Chua, Ee-Peng Lim:
Structural Analysis in Multi-Relational Social Networks. SDM 2012: 451-462 - Hanbo Dai, Feida Zhu, Ee-Peng Lim, HweeHwa Pang:
Detecting Extreme Rank Anomalous Collections. SDM 2012: 883-894 - Weishan Dong, Xin Zhang, Li Li, Changhua Sun, Lei Shi, Wei Sun:
Detecting Irregularly Shaped Significant Spatial and Spatio-Temporal Clusters. SDM 2012: 732-743 - Anton Dries, Siegfried Nijssen:
Mining Patterns in Networks using Homomorphism. SDM 2012: 260-271 - George Forman:
Feature Selection "Tomography" - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable. SDM 2012: 485-493 - Nikolaos M. Freris, Michail Vlachos, Suleyman Serdar Kozat:
Optimal Distance Estimation Between Compressed Data Series. SDM 2012: 343-354 - Nikolaos M. Freris, Michail Vlachos, Deepak S. Turaga:
Cluster-Aware Compression with Provable K-means Preservation. SDM 2012: 82-93 - Qiang Fu, Arindam Banerjee, Stefan Liess, Peter K. Snyder:
Drought Detection of the Last Century: An MRF-based Approach. SDM 2012: 24-34 - Amita Gajewar, Atish Das Sarma:
Multi-skill Collaborative Teams based on Densest Subgraphs. SDM 2012: 165-176 - Liang Ge, Aidong Zhang:
Pseudo Cold Start Link Prediction with Multiple Sources in Social Networks. SDM 2012: 768-779 - Mehmet Gönen:
Bayesian Supervised Multilabel Learning with Coupled Embedding and Classification. SDM 2012: 367-378
skipping 69 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 20:17 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