Остановите войну!
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 23 matches
- 2003
- Abdul Nasser S. Abu-Rezq:
Adaptive Growth of Committee Machines. Int. J. Comput. Their Appl. 10(1): 2-8 (2003) - H. Arafat Ali, Ali I. El-Desouky, M. Mahfouz:
Implementation and Analysis of Bilingual English/Arabic Articulated Document Analysis and Understanding System. Int. J. Comput. Their Appl. 10(2): 83-93 (2003) - Bassel R. Arafeh:
Non-Linear Clustering Algorithm for Scheduling Parallel Programs with Synchronous Communication on NOWs. Int. J. Comput. Their Appl. 10(2): 103-114 (2003) - Shawki Areibi, Anthony Vannelli:
Tabu Search: Implementation & Complexity Analysis for Netlist Partitioning. Int. J. Comput. Their Appl. 10(4): 211-232 (2003) - Sanjeev Baskiyar, Natarajan Meghanathan:
Binary Codes for Fast Determination of Ancestor-Descendant Relationship in Trees and Directed A-cyclic Graphs. Int. J. Comput. Their Appl. 10(1): 67-71 (2003) - Tahany A. Fergany, Amany M. Sarhan:
Restructuring Object-Oriented Real-Time Distributed Software for Pipeline Environment. Int. J. Comput. Their Appl. 10(2): 115-124 (2003) - Aboul Ella Hassanien, Jafar M. H. Ali:
Rough Sets Analysis for Reduct Generation of Breast Cancer Data. Int. J. Comput. Their Appl. 10(4): 263-270 (2003) - Ahmed H. Kamal, James H. Graham, C. David Page Jr.:
A Parallel Inductive Logic Programming Data Mining System for Drug Discovery. Int. J. Comput. Their Appl. 10(3): 161-170 (2003) - Mohammad Shakeel Laghari:
Shape and Edge Detail Analysis for Wear Debris Identification. Int. J. Comput. Their Appl. 10(4): 271-283 (2003) - Keon-Jik Lee, Kee-Won Kim, Won-Ho Lee, Young-Jun Heo, Kee-Young Yoo:
Design of a Linear Systolic Modular Multiplier/Squarer for the Fast Modular Exponentiation. Int. J. Comput. Their Appl. 10(1): 34-42 (2003) - Spiridon D. Likothanassis, Grigorios N. Beligiannis, Dimitris Fotakis, Dimitris Fragoudis, Konstantinos C. Giotopoulos:
An Evolutionary Computation Technique for User Profile Optimization. Int. J. Comput. Their Appl. 10(1): 25-33 (2003) - Jyhjong Lin, Chun-Hsiu Yeh:
An Object-Oriented Software Project Management Model and Environment. Int. J. Comput. Their Appl. 10(4): 247-262 (2003) - Jiang B. Liu, Igor V. Motov:
Distributed Job Scheduling in Clustered Networks. Int. J. Comput. Their Appl. 10(1): 43-50 (2003) - Qutaibah M. Malluhi, Gwang S. Jung:
Enabling High-Performance Data Service in the Web Environment. Int. J. Comput. Their Appl. 10(2): 125-133 (2003) - Basilis Mamalis, Paul G. Spirakis, Basil Tampakas:
Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks. Int. J. Comput. Their Appl. 10(1): 51-66 (2003) - Ravi Pendse, S. Ananthanarayana, Ravi Bhagavathula, R. Rajamoni:
Measurement of FAX Quality on a Fax over IP Network. Int. J. Comput. Their Appl. 10(2): 73-82 (2003) - Rami Qahwaji:
Detecting Edges in Noisy Face Database Images. Int. J. Comput. Their Appl. 10(3): 185-197 (2003) - J. Wenny Rahayu, David Taniar, Nung Kion Lee, Eric Pardede:
Study of Using an Object-Relational Paradigm in Building a Web Database Application. Int. J. Comput. Their Appl. 10(3): 171-184 (2003) - Muhammad Sarfraz:
Curve Fitting for Large Data Using Rational Cubic Splines. Int. J. Comput. Their Appl. 10(4): 233-246 (2003) - Edwin Hsing-Mean Sha, Timothy W. O'Neil, Nelson L. Passos:
Efficient Polynomial-Time Nested Loop Fusion with Full Parallelism. Int. J. Comput. Their Appl. 10(1): 9-24 (2003) - S. R. Subramanya, Abdou Youssef, Bhagirath Narahari, Rahul Simha:
Audio Data Indexing Using Discrete Cosine Transform. Int. J. Comput. Their Appl. 10(3): 198-210 (2003) - Mohamed F. Tolba, Gamal Abdul Moty, Ahmed Mahmoud:
Segmentation Free Approach for Printed Arabic Text Recognition. Int. J. Comput. Their Appl. 10(2): 94-102 (2003) - Yongdong Wang, Michael Jurczyk:
Impact of ATM Traffic Shaping on MPEG-2 Video Quality. Int. J. Comput. Their Appl. 10(3): 149-160 (2003)
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-06-15 13:00 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