Sciweavers

2569 search results - page 94 / 514
» Approximate Objects and Approximate Theories
Sort
View
SPIRE
2010
Springer
15 years 4 months ago
Text Comparison Using Soft Cardinality
Abstract. The classical set theory provides a method for comparing objects using cardinality and intersection, in combination with well-known resemblance coefficients such as Dice,...
Sergio Jimenez, Fabio Gonzalez, Alexander F. Gelbu...
INFOCOM
2006
IEEE
16 years 11 days ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
CORR
2006
Springer
81views Education» more  CORR 2006»
15 years 6 months ago
Multivariate Integral Perturbation Techniques - I (Theory)
We present a quasi-analytic perturbation expansion for multivariate N dimensional Gaussian integrals. The perturbation expansion is an infinite series of lower-dimensional integra...
Jan W. Dash
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
13 years 8 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 6 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...