default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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
Exact 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 68 matches
- 2024
- Tim Kaler, Xuhao Chen, Brian Wheatman, Dorothy Curtis, Bruce Hoppe, Tao B. Schardl, Charles E. Leiserson:
Speedcode: Software Performance Engineering Education via the Coding of Didactic Exercises. IPDPS (Workshops) 2024: 391-394 - Claudio Bellei, Muhua Xu, Ross Phillips, Tom Robinson, Mark Weber, Tim Kaler, Charles E. Leiserson, Arvind, Jie Chen:
The Shape of Money Laundering: Subgraph Representation Learning on the Blockchain with the Elliptic2 Dataset. CoRR abs/2404.19109 (2024) - 2023
- Tim Kaler, Alexandros-Stavros Iliopoulos, Philip Murzynowski, Tao B. Schardl, Charles E. Leiserson, Jie Chen:
Communication-Efficient Graph Neural Networks with Probabilistic Neighborhood Expansion Analysis and Caching. MLSys 2023 - Tim Kaler, Alexandros-Stavros Iliopoulos, Philip Murzynowski, Tao B. Schardl, Charles E. Leiserson, Jie Chen:
Communication-Efficient Graph Neural Networks with Probabilistic Neighborhood Expansion Analysis and Caching. CoRR abs/2305.03152 (2023) - 2022
- Tim Kaler, Nickolas Stathas, Anne Ouyang, Alexandros-Stavros Iliopoulos, Tao B. Schardl, Charles E. Leiserson, Jie Chen:
Accelerating Training and Inference of Graph Neural Networks with Fast Sampling and Pipelining. MLSys 2022 - William Hasenplaugh, Tim Kaler, Tao B. Schardl, Charles E. Leiserson:
Ordering Heuristics for Parallel Graph Coloring. Massive Graph Analytics 2022: 193-221 - Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson:
Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling. Massive Graph Analytics 2022: 397-429 - 2021
- Chien Lu, Jaakko Peltonen, Timo Nummenmaa, Jyrki Nummenmaa, Kalervo Jäarvelin:
Cross-structural Factor-topic Model: Document Analysis with Sophisticated Covariates. ACML 2021: 1129-1144 - Tim Kaler, Tao B. Schardl, Brian Xie, Charles E. Leiserson, Jie Chen, Aldo Pareja, Georgios Kollias:
PARAD: A Work-Efficient Parallel Algorithm for Reverse-Mode Automatic Differentiation. APOCS 2021: 144-158 - Tim Kaler, Nickolas Stathas, Anne Ouyang, Alexandros-Stavros Iliopoulos, Tao B. Schardl, Charles E. Leiserson, Jie Chen:
Accelerating Training and Inference of Graph Neural Networks with Fast Sampling and Pipelining. CoRR abs/2110.08450 (2021) - 2020
- Aldo Pareja, Giacomo Domeniconi, Jie Chen, Tengfei Ma, Toyotaro Suzumura, Hiroki Kanezashi, Tim Kaler, Tao B. Schardl, Charles E. Leiserson:
EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs. AAAI 2020: 5363-5370 - Tim Kaler, William Kuszmaul, Tao B. Schardl, Daniele Vettorel:
Cilkmem: Algorithms for Analyzing the Memory High-Water Mark of Fork-Join Parallel Programs. APOCS 2020: 162-176 - Tim Kaler, Brian Wheatman
, Sarah Wooders:
High-Throughput Image Alignment for Connectomics using Frugal Snap Judgments. HPEC 2020: 1-9 - 2019
- Jorge A. Vázquez-Diosdado, Veronica Paul, Keith A. Ellis, David Coates, Radhika Loomba, Jasmeet Kaler:
A Combined Offline and Online Algorithm for Real-Time and Long-Term Classification of Sheep Behaviour: Novel Approach for Precision Livestock Farming. Sensors 19(14): 3201 (2019) - Tim Kaler, Brian Wheatman, Sarah Wooders:
High-throughput image alignment for connectomics using frugal snap judgments: poster. PPoPP 2019: 433-434 - Aldo Pareja, Giacomo Domeniconi, Jie Chen, Tengfei Ma, Toyotaro Suzumura, Hiroki Kanezashi, Tim Kaler, Charles E. Leiserson:
EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs. CoRR abs/1902.10191 (2019) - Tim Kaler, William Kuszmaul, Tao B. Schardl, Daniele Vettorel:
Cilkmem: Algorithms for Analyzing the Memory High-Water Mark of Fork-Join Parallel Programs. CoRR abs/1910.12340 (2019) - 2018
- Miamaria Saastamoinen, Kalervo Järvelin:
Relationships between work task types, complexity and dwell time of information resources. J. Inf. Sci. 44(2): 265-284 (2018) - Mark Weber, Jie Chen, Toyotaro Suzumura, Aldo Pareja, Tengfei Ma, Hiroki Kanezashi, Tim Kaler, Charles E. Leiserson, Tao B. Schardl:
Scalable Graph Learning for Anti-Money Laundering: A First Look. CoRR abs/1812.00076 (2018) - 2017
- Alexander Matveev, Yaron Meirovitch, Hayk Saribekyan, Wiktor Jakubiuk, Tim Kaler, Gergely Ódor, David M. Budden, Aleksandar Zlateski, Nir Shavit:
A Multicore Path to Connectomics-on-Demand. PPoPP 2017: 267-281 - Tim Kaler, Yuxiong He, Sameh Elnikety:
Optimal Reissue Policies for Reducing Tail Latency. SPAA 2017: 195-206 - 2016
- Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson:
Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling. ACM Trans. Parallel Comput. 3(1): 2:1-2:31 (2016) - 2015
- Erik D. Demaine, Tim Kaler, Quanquan C. Liu, Aaron Sidford, Adam Yedidia:
Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing. WADS 2015: 263-275 - 2014
- Timo Niemi, Marko Junkkari, Kalervo Järvelin:
Concept-based query language approach to enterprise information systems. Enterp. Inf. Syst. 8(1): 26-66 (2014) - William Hasenplaugh, Tim Kaler, Tao B. Schardl, Charles E. Leiserson:
Ordering heuristics for parallel graph coloring. SPAA 2014: 166-177 - Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson:
Executing dynamic data-graph computations deterministically using chromatic scheduling. SPAA 2014: 154-165 - 2012
- Feza Baskaya, Heikki Keskustalo, Kalervo Järvelin:
Time drives interaction: simulating sessions in diverse searching environments. SIGIR 2012: 105-114 - 2010
- Janne Jämsen, Timo Niemi, Kalervo Järvelin:
Derived types in semantic association discovery. J. Intell. Inf. Syst. 35(2): 213-244 (2010) - Tim Kaler, John Patrick Lynch, Timothy Peng, Lenin Ravindranath, Arvind Thiagarajan, Hari Balakrishnan, Samuel Madden:
Code in the air: simplifying sensing on smartphones. SenSys 2010: 407-408 - 2009
- Timo Niemi, Turkka Näppilä, Kalervo Järvelin:
A relational data harmonization approach to XML. J. Inf. Sci. 35(5): 571-601 (2009)
skipping 38 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-10-06 06:51 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
