Sciweavers

2631 search results - page 115 / 527
» A Practical Method for the Sparse Resultant
Sort
View
ICANN
2009
Springer
15 years 11 months ago
Empirical Study of the Universum SVM Learning for High-Dimensional Data
Abstract. Many applications of machine learning involve sparse highdimensional data, where the number of input features is (much) larger than the number of data samples, d n. Predi...
Vladimir Cherkassky, Wuyang Dai
COCOON
2000
Springer
15 years 10 months ago
Recent Progress and Prospects for Integer Factorisation Algorithms
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
Richard P. Brent
JCNS
2010
90views more  JCNS 2010»
15 years 1 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
AAAI
1994
15 years 7 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter
PKDD
2001
Springer
127views Data Mining» more  PKDD 2001»
15 years 10 months ago
Sentence Filtering for Information Extraction in Genomics, a Classification Problem
In some domains, Information Extraction (IE) from texts requires syntactic and semantic parsing. This analysis is computationally expensive and IE is potentially noisy if it applie...
Claire Nedellec, Mohamed Ould Abdel Vetah, Philipp...