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 42 matches
- 2003
- Zeyar Aung, Wei Fu, Kian-Lee Tan:
An Efficient Index-based Protein Structure Database Searching Method. DASFAA 2003: 311-318 - Michael Barg, Raymond K. Wong:
Fast and Versatile ath Index for Querying Semi-Structured Data. DASFAA 2003: 249-256 - Sarah Chan, Ben Kao, Chi Lap Yip, Michael Tang:
Mining Emerging Substrings. DASFAA 2003: 119-126 - Ya-Hui Chang, Cheng-Ta Lee:
Supporting Selection-Projection XQuery Processing Based on Encoding Paths. DASFAA 2003: 241-248 - Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu:
Approximate String Matching in DNA Sequences. DASFAA 2003: 303-310 - Jiefeng Cheng, Ge Yu, Guoren Wang, Jeffrey Xu Yu:
PathGuide: An Efficient Clustering Based Indexing Method for XML Path Expressions. DASFAA 2003: 257-264 - Kajal T. Claypool, Elke A. Rundensteiner:
Gangam: A Transformation Modeling Framework. DASFAA 2003: 47-54 - João Pedro Costa, Pedro Furtado:
Time-Stratified Sampling for Approximate Answers to Aggregate Queries. DASFAA 2003: 215-222 - Rui Ding, Xiaofeng Meng, Yun Bai:
Efficient Index Update for Moving Objects with Future Trajectories. DASFAA 2003: 183-191 - Punit R. Doshi, Elke A. Rundensteiner, Matthew O. Ward:
Prefetching for Visual Data Exploratio. DASFAA 2003: 195-202 - Manuel J. Fonseca, Joaquim A. Jorge:
Indexing High-Dimensional Data for Content-Based Retrieval in Large Databases. DASFAA 2003: 267-274 - Pedro Furtado, João Pedro Costa:
The BofS Solution to Limitations of Approximate Summaries. DASFAA 2003: 223-230 - Gang Gou, Jeffrey Xu Yu, Chi-Hon Choi, Hongjun Lu:
An Efficient and Interactive A*-Algorithm with Pruning Power: Materialized View Selection Revisited. DASFAA 2003: 231-238 - Lilian Harada:
An Efficient Sliding Window Algorithm for Detection of Sequential Pattern. DASFAA 2003: 73-80 - Noriko Imafuji, Masaru Kitsuregawa:
Finding a Web Community by Maximum Flow Algorithm with HITS Score Based Capacity. DASFAA 2003: 101-106 - Liang Jin, Chen Li, Sharad Mehrotra:
Efficient Record Linkage in Large Data Sets. DASFAA 2003: 137-146 - Dmitri V. Kalashnikov, Sunil Prabhakar:
Similarity Join for Low-and High-Dimensional Data. DASFAA 2003: 7-16 - Kin-Fai Kan, David W. Cheung, Ben Kao:
Maintenance of Partial-Sum-Based Histograms. DASFAA 2003: 149-156 - Timour Katchaounov, Vanja Josifovski, Tore Risch:
Scalable View Expansion in a Peer Mediator System. DASFAA 2003: 107-116 - Jaehoon Kim, Seog Park:
Performance Enhancement through Structural Redundancy in Mapping XML into Relations. DASFAA 2003: 345-354 - Hans-Peter Kriegel, Peer Kröger, Zahi Mashael, Martin Pfeifle, Marco Pötke, Thomas Seidl:
Effective Similarity Search on Voxelized CAD Object. DASFAA 2003: 27-36 - Hans-Peter Kriegel, Martin Pfeifle, Marco Pötke, Thomas Seidl:
Spatial Query Processing for High Resolutions. DASFAA 2003: 17-26 - Wen-Syan Li, Oliver Po, Wang-Pin Hsiung, K. Selçuk Candan, Divyakant Agrawal:
Freshness-driven Adaptive Caching for Dynamic Content. DASFAA 2003: 203-212 - Xuemin Lin, Qing Zhang:
Error Minimization for Approximate Computation of Range Aggregate. DASFAA 2003: 165-172 - Guimei Liu, Hongjun Lu, Yabo Xu, Jeffrey Xu Yu:
Ascending Frequency Ordered Prefix-tree: Efficient Mining of Frequent Patterns. DASFAA 2003: 65-72 - Shoko Miyake, Yukako Tohsato, Yoichi Takenaka, Hideo Matsuda:
Clustering Method for Comparative Analysis between Genomes and Pathways. DASFAA 2003: 327-334 - Wei Ni, Tok Wang Ling:
GLASS: A Graphical Query Language for Semi-Structured Data. DASFAA 2003: 363-370 - Said Mirza Pahlevi, Hiroyuki Kitagawa:
TAX-PQ: Dynamic Taxonomy Probing and Query Modification for Topic-Focused Web Searc. DASFAA 2003: 91-100 - Xiaolin Pang, Barbara Catania, Kian-Lee Tan:
Securing Your Data in Agent-Based P2P Systems. DASFAA 2003: 55-62 - Rie Sawai, Masahiko Tsukamoto, Tsutomu Terada, Shojiro Nishio:
Composition of Filtering Functions. DASFAA 2003: 293-300
skipping 12 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-12-02 03:49 CET 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