Results 1 - 10 of 3,476

Space/Time Trade-offs in Hash Coding with Allowable Errors

by Burton H. Bloom - Communications of the ACM , 1970
"... this paper trade-offs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages one-by-one for membership in a given set of messages. Two new hash- coding methods are examined and compared with a particular conventional h ..."
Abstract - Cited by 2097 (0 self) - Add to MetaCart
this paper trade-offs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages one-by-one for membership in a given set of messages. Two new hash- coding methods are examined and compared with a particular conventional

A support vector method for multivariate performance measures

by Thorsten Joachims - Proceedings of the 22nd International Conference on Machine Learning , 2005
"... This paper presents a Support Vector Method for optimizing multivariate nonlinear performance measures like the F1score. Taking a multivariate prediction approach, we give an algorithm with which such multivariate SVMs can be trained in polynomial time for large classes of potentially non-linear per ..."
Abstract - Cited by 305 (6 self) - Add to MetaCart
-linear performance measures, in particular ROCArea and all measures that can be computed from the contingency table. The conventional classification SVM arises as a special case of our method. 1.

The log of Gravity

by Joao Santos Silva , Silvana Tenreyro - THE REVIEW OF ECONOMICS AND STATISTICS , 2005
"... Although economists have long been aware of Jensen's inequality, many econometric applications have neglected an important implication of it: the standard practice of interpreting the parameters of log-linearized models estimated by ordinary least squares as elasticities can be highly misleadin ..."
Abstract - Cited by 333 (6 self) - Add to MetaCart
develop the argument using one particular illustration, the gravity equation for trade, and apply the proposed technique to provide new estimates of this equation. We find significant differences between estimates obtained with the proposed estimator and those obtained with the traditional method

Cutting-Plane Training of Structural SVMs

by Thorsten Joachims, Thomas Finley, Chun-nam John Yu , 2007
"... Discriminative training approaches like structural SVMs have shown much promise for building highly complex and accurate models in areas like natural language processing, protein structure prediction, and information retrieval. However, current training algorithms are computationally expensive or i ..."
Abstract - Cited by 321 (10 self) - Add to MetaCart
or intractable on large datasets. To overcome this bottleneck, this paper explores how cutting-plane methods can provide fast training not only for classification SVMs, but also for structural SVMs. In particular, we show that in an equivalent “1-slack” reformulation of the linear SVM training problem, our

A Measure of Betweenness Centrality Based on Random Walks. arXiv cond-mat/0309045.,

by M E J Newman , 2003
"... Abstract Betweenness is a measure of the centrality of a node in a network, and is normally calculated as the fraction of shortest paths between node pairs that pass through the node of interest. Betweenness is, in some sense, a measure of the influence a node has over the spread of information thr ..."
Abstract - Cited by 281 (0 self) - Add to MetaCart
through the network. By counting only shortest paths, however, the conventional definition implicitly assumes that information spreads only along those shortest paths. Here, we propose a betweenness measure that relaxes this assumption, including contributions from essentially all paths between nodes

Characterization of microbial diversity by determining terminal restriction length polymorphisms of genes encoding 16S rDNA.

by Wen-Tso Liu , Terence L Marsh , Hans Cheng , Larry J Forney - Appl. Environ. Microbiol. , 1997
"... A quantitative molecular technique was developed for rapid analysis of microbial community diversity in various environments. The technique employed PCR in which one of the two primers used was fluorescently labeled at the 5 end and was used to amplify a selected region of bacterial genes encoding ..."
Abstract - Cited by 263 (7 self) - Add to MetaCart
within a community) are two essential parameters for defining community structure and diversity. Quantitation of these two parameters is severely limited by conventional culture-dependent methods by virtue of the fact that large fractions (Ͼ85 to 99.999%) of the organisms existing in nature appear

Bayesian Haplotype Inference for Multiple Linked Single-Nucleotide Polymorphisms .American

by Tianhua Niu, Zhaohui S. Qin, Xiping Xu, Jun S. Liu - Journal of Human Genetics , 2002
"... Haplotypes have gained increasing attention in the mapping of complex-disease genes, because of the abundance of single-nucleotide polymorphisms (SNPs) and the limited power of conventional single-locus analyses. It has been shown that haplotype-inference methods such as Clark’s algorithm, the expec ..."
Abstract - Cited by 230 (6 self) - Add to MetaCart
Haplotypes have gained increasing attention in the mapping of complex-disease genes, because of the abundance of single-nucleotide polymorphisms (SNPs) and the limited power of conventional single-locus analyses. It has been shown that haplotype-inference methods such as Clark’s algorithm

Main memory database systems: An overview

by Hector Garcia-molina, Kenneth Salem - IEEE Transactions on Knowledge and Data Engineering , 1992
"... Abstract-Memory resident database systems (MMDB’s) store their data in main physical memory and provide very high-speed access. Conventional database systems are optimized for the particular characteristics of disk storage mechanisms. Memory resident systems, on the other hand, use different optimiz ..."
Abstract - Cited by 221 (2 self) - Add to MetaCart
Abstract-Memory resident database systems (MMDB’s) store their data in main physical memory and provide very high-speed access. Conventional database systems are optimized for the particular characteristics of disk storage mechanisms. Memory resident systems, on the other hand, use different

Low-complexity Wyner-Ziv video coding based on robust media hashing

by Li-wei Kang, Chun-shien Lu - Proc. of IEEE Int. Workshop on Multimedia Signal Process , 2006
"... Abstract—To meet the requirement of distributed video coding in resource-limited sensor networks, Wyner-Ziv theorem-based source coding with side information available at the decoder states that an intraframe encoder with interframe decoder system can achieve comparable coding efficiency of a conven ..."
Abstract - Cited by 4 (4 self) - Add to MetaCart
reference frame are efficiently extracted and used for frame recovery based on robust image hashing without needing to perform motion estimation. The particular contribution of our method is its low complexity in both the encoder and decoder sides. Simulation results demonstrate the achievable coding

Classification of hyperspectral remote sensing images with support vector machines

by Farid Melgani, Lorenzo Bruzzone, Senior Member - IEEE Trans. Geosci. Remote Sens , 2004
"... Abstract—This paper addresses the problem of the classifica-tion of hyperspectral remote sensing images by support vector machines (SVMs). First, we propose a theoretical discussion and experimental analysis aimed at understanding and assessing the potentialities of SVM classifiers in hyperdimension ..."
Abstract - Cited by 188 (5 self) - Add to MetaCart
in hyperdimensional feature spaces. Then, we assess the effectiveness of SVMs with respect to conventional feature-reduction-based approaches and their performances in hypersubspaces of various dimensionalities. To sustain such an analysis, the performances of SVMs are compared with those of two other nonparametric
Results 1 - 10 of 3,476