Остановите войну!
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 157 matches
- 2024
- Yutong Shao, Ndapa Nakashole:
On Linearizing Structured Data in Encoder-Decoder Language Models: Insights from Text-to-SQL. CoRR abs/2404.02389 (2024) - 2023
- Jorge Blázquez, Manuel Montenegro, Clara Segura:
Verification of mutable linear data structures and iterator-based algorithms in Dafny. J. Log. Algebraic Methods Program. 134: 100875 (2023) - Dai Hai Nguyen, Koji Tsuda:
On a linear fused Gromov-Wasserstein distance for graph structured data. Pattern Recognit. 138: 109351 (2023) - Weichen Shang, Hang Yu, Qingyu Li, He Zhang, Keren Dai:
Optimal Linear Filter Based on Feedback Structure for Sensing Network with Correlated Noises and Data Packet Dropout. Sensors 23(12): 5673 (2023) - Yi Zhang, Yu Zhang, Wei Wang:
Learning Linear and Nonlinear Low-Rank Structure in Multi-Task Learning. IEEE Trans. Knowl. Data Eng. 35(8): 8157-8170 (2023) - Vaibhav Kashera, Siddhant Jain, Abhishek Banerjee, Suresh Purini:
Building Low-Latency Order Books with Hybrid Binary-Linear Search Data Structures on FPGAs. FPL 2023: 299-304 - Hannah Pinson, Joeri Lenaerts, Vincent Ginis:
Linear CNNs Discover the Statistical Structure of the Dataset Using Only the Most Dominant Frequencies. ICML 2023: 27876-27906 - Chen Cheng, Gary Cheng, John C. Duchi:
Collaboratively Learning Linear Models with Structured Missing Data. NeurIPS 2023 - Liangchen Liu, Juncai He, Yen-Hsi Tsai:
Linear Regression on Manifold Structured Data: the Impact of Extrinsic Geometry on Solutions. TAG-ML 2023: 557-576 - Bireswar Das, Anant Kumar, Shivdutt Sharma, Dhara Thakkar:
Linear Space Data Structures for Finite Groups with Constant Query-time. CoRR abs/2303.01957 (2023) - Hannah Pinson, Joeri Lenaerts, Vincent Ginis:
Linear CNNs Discover the Statistical Structure of the Dataset Using Only the Most Dominant Frequencies. CoRR abs/2303.02034 (2023) - Liangchen Liu, Juncai He, Richard Tsai:
Linear Regression on Manifold Structured Data: the Impact of Extrinsic Geometry on Solutions. CoRR abs/2307.02478 (2023) - Chen Cheng, Gary Cheng, John C. Duchi:
Collaboratively Learning Linear Models with Structured Missing Data. CoRR abs/2307.11947 (2023) - Samuel Marks, Max Tegmark:
The Geometry of Truth: Emergent Linear Structure in Large Language Model Representations of True/False Datasets. CoRR abs/2310.06824 (2023) - 2022
- Sergio Torres Aguilar, Pierre Chastang, Xavier Tannier:
Automatic medieval charters structure detection : A Bi-LSTM linear segmentation approach. J. Data Min. Digit. Humanit. 2022 (2022) - Xiangyu Zou, Jingsong Yuan, Philip Shilane, Wen Xia, Haijun Zhang, Xuan Wang:
From Hyper-dimensional Structures to Linear Structures: Maintaining Deduplicated Data's Locality. ACM Trans. Storage 18(3): 25:1-25:28 (2022) - Jacob Nelson-Slivon, Ahmed Hassan, Roberto Palmieri:
Bundling linked data structures for linearizable range queries. PPoPP 2022: 368-384 - Ken Higuchi, Ami Miyazaki, Kenya Hasegawa, Tatsuo Tsuji:
Data Structures for Routing Table of the Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph with the Load Balancing Method. SNPD-Summer 2022: 101-106 - Bireswar Das, Anant Kumar, Shivdutt Sharma, Dhara Thakkar:
Linear Space Data Structures for Finite Groups with Constant Query-Time. STACS 2022: 25:1-25:17 - Xuejian Li, Yun Yu:
Quantified Assertion Verification Method for Non-linear Arithmetic and Mutable Data Structures. WSSE 2022: 39-44 - Jacob Nelson-Slivon, Ahmed Hassan, Roberto Palmieri:
Technical Report: Bundling Linked Data Structures for Linearizable Range Queries. CoRR abs/2201.00874 (2022) - Dai Hai Nguyen, Koji Tsuda:
On a linear fused Gromov-Wasserstein distance for graph structured data. CoRR abs/2203.04711 (2022) - Siddhartha Visveswara Jayanti:
Generalized Wake-Up: Amortized Shared Memory Lower Bounds for Linearizable Data Structures. CoRR abs/2207.07561 (2022) - Qisheng Wang, Ming Yang, Xinrui Zhu:
Double-Ended Palindromic Trees: A Linear-Time Data Structure and Its Applications. CoRR abs/2210.02292 (2022) - 2021
- Timothy Opheim, Anuradha Roy:
Linear models for multivariate repeated measures data with block exchangeable covariance structure. Comput. Stat. 36(3): 1931-1963 (2021) - Marco Gherardi:
Solvable Model for the Linear Separability of Structured Data. Entropy 23(3): 305 (2021) - Weiqing Fu, Hamid Parvin, Mohammad Reza Mahmoudi, Bui Anh Tuan, Kim-Hung Pho:
A linear space adjustment by mapping data into an intermediate space and keeping low level data structures. J. Exp. Theor. Artif. Intell. 33(4): 637-657 (2021) - Zhaozhuo Xu, Zhao Song, Anshumali Shrivastava:
Breaking the Linear Iteration Cost Barrier for Some Well-known Conditional Gradient Methods Using MaxIP Data-structures. NeurIPS 2021: 5576-5589 - Anshumali Shrivastava, Zhao Song, Zhaozhuo Xu:
Breaking the Linear Iteration Cost Barrier for Some Well-known Conditional Gradient Methods Using MaxIP Data-structures. CoRR abs/2111.15139 (2021) - 2020
- Xuan He, Kui Cai:
Disjoint-Set Data Structure-Aided Structured Gaussian Elimination for Solving Sparse Linear Systems. IEEE Commun. Lett. 24(11): 2445-2449 (2020)
skipping 127 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-15 02:37 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