Sciweavers

2190 search results - page 358 / 438
» Learning Relations Using Collocations
Sort
View
AUSAI
2007
Springer
14 years 5 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
ECLIPSE
2005
ACM
14 years 1 months ago
Coping with an open bug repository
Most open source software development projects include an open bug repository—one to which users of the software can gain full access—that is used to report and track problems...
John Anvik, Lyndon Hiew, Gail C. Murphy
NIPS
2007
14 years 17 days ago
A New View of Automatic Relevance Determination
Automatic relevance determination (ARD) and the closely-related sparse Bayesian learning (SBL) framework are effective tools for pruning large numbers of irrelevant features leadi...
David P. Wipf, Srikantan S. Nagarajan
AAAI
1994
14 years 14 days ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
AES
2008
Springer
133views Cryptology» more  AES 2008»
13 years 11 months ago
Alternative neural networks to estimate the scour below spillways
Artificial neural networks (ANN's) are associated with difficulties like lack of success in a given problem and unpredictable level of accuracy that could be achieved. In eve...
H. Md. Azamathulla, M. C. Deo, P. B. Deolalikar