Results 261 to 270 of about 12,565,488 (299)
A Note on the Unified Forms of Triple I Method
Computers and Mathematics With Applications, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hua-Wen Liu, Guo-Jun Wang
exaly +4 more sources
Some of the next articles are maybe not open access.
A unified retrieval method of multimedia documents
Proceedings Seventh International Conference on Database Systems for Advanced Applications DASFAA 2001 DASFAA-01, 2001In this paper, we propose a retrieval method for multimedia documents. In our method, features of each medium such as text, image, and their layout information are extracted from documents. For a given query, similarity values are calculated for each media, then those values are integrated into one similarity value per document. We propose four methods
Yu Suzuki 0001 +3 more
openaire +1 more source
A unifying data structure for hierarchical methods
Proceedings of the 1999 ACM/IEEE conference on Supercomputing, 1999We present a data structure for supporting the access patterns required by most scientific applications that employ hierarchical methods. The data structure, termed the Distribution Independent Adaptive Tree, efficiently supports both grid-based and particle-based methods.
Fatih Erdogan Sevilgen, Srinivas Aluru
openaire +1 more source
Engineering Journal, 1991
A new unified method of inelastic analysis that can be applied in both the AASHTO overload and maximum load checks is developed in this paper. Formerly, different methods of analysis were used in these two checks in the AASHTO alternate load factor design procedures.
openaire +1 more source
A new unified method of inelastic analysis that can be applied in both the AASHTO overload and maximum load checks is developed in this paper. Formerly, different methods of analysis were used in these two checks in the AASHTO alternate load factor design procedures.
openaire +1 more source
Robust clustering methods: a unified view
IEEE Transactions on Fuzzy Systems, 1997Clustering methods need to be robust if they are to be useful in practice. In this paper, we analyze several popular robust clustering methods and show that they have much in common. We also establish a connection between fuzzy set theory and robust statistics, and point out the similarities between robust clustering methods and statistical methods ...
Rajesh N. Davé, Raghuram Krishnapuram
openaire +2 more sources
Shortest path methods: A unifying approach
1986This paper gives a review of algorithms for the problem of finding shortest paths in a directed graph with given arc lengths. Firstly, the problem of finding shortest paths from a given origin node to all other nodes of the graph is considered. A general algorithm is outlined in which nodes of the graph are assigned labels that are successively updated
GALLO G., PALLOTTINO, STEFANO
openaire +3 more sources
A unified method for phase shifter computation
ACM Transactions on Design Automation of Electronic Systems, 2005Phase shifters are used to shift the bit sequences produced by the successive stages of a built-in test pattern generator (TPG) based on a linear finite state machine (LFSM) by a specified amount ( phase shift ) relative to the characteristic sequence.
openaire +1 more source
A Unifying Framework for Reconstructive Imaging Methods
1987Reconstructive imaging methods, such as CT or MRI, produce their images in a two stage process: First, the object to be imaged is probed using some form of physical radiation, and then the image is computed, or reconstructed, from the outcome of the probing.
openaire +2 more sources
A Unified Method for Asymptotic Outage Analysis
IEEE Wireless Communications LettersThis letter develops a unified method to perform the asymptotic analysis of the outage probability for a general wireless communication system. On the basis of the asymptotic results, the diversity order and the modulation and coding gain are derived in closed-form together with some special mathematical properties.
Zheng Shi 0001 +4 more
openaire +2 more sources
Unifying learning methods by colored digraphs
1993We describe a graph-based induction algorithm that extracts typical patterns from colored digraphs. The method is shown to be capable of solving a variety of learning problems by mapping the different learning problems into colored digraphs. The generality and scope of this method can be attributed to the expressiveness of the colored digraph ...
Kenichi Yoshida +2 more
openaire +2 more sources