Sciweavers

1957 search results - page 45 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
15 years 10 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
GECCO
2006
Springer
196views Optimization» more  GECCO 2006»
15 years 1 months ago
An anticipatory approach to improve XCSF
XCSF is a novel version of learning classifier systems (LCS) which extends the typical concept of LCS by introducing computable classifier prediction. In XCSF Classifier predictio...
Amin Nikanjam, Adel Torkaman Rahmani
ICA
2010
Springer
14 years 10 months ago
Dictionary Learning for Sparse Representations: A Pareto Curve Root Finding Approach
Abstract. A new dictionary learning method for exact sparse representation is presented in this paper. As the dictionary learning methods often iteratively update the sparse coeffi...
Mehrdad Yaghoobi, Mike E. Davies
FOCS
2008
IEEE
15 years 4 months ago
Sketching and Streaming Entropy via Approximation Theory
We give near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves ...
Nicholas J. A. Harvey, Jelani Nelson, Krzysztof On...
73
Voted
ISSAC
2007
Springer
93views Mathematics» more  ISSAC 2007»
15 years 3 months ago
Approximate bivariate factorization: a geometric viewpoint
We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in   [x, y]. Given a composite polyno...
André Galligo, Mark van Hoeij