Sciweavers

507 search results - page 101 / 102
» How well can we estimate a sparse vector
Sort
View
IPPS
2005
IEEE
13 years 11 months ago
Self-Adaptive Scheduler Parameterization via Online Simulation
High-end parallel systems present a tremendous research challenge on how to best allocate their resources to match dynamic workload characteristics and user habits that are often ...
Barry Lawson, Evgenia Smirni
AUSAI
2003
Springer
13 years 10 months ago
Choosing Learning Algorithms Using Sign Tests with High Replicability
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
Remco R. Bouckaert
FLAIRS
2004
13 years 6 months ago
Satisfying Varying Retrieval Requirements in Case Based Intelligent Directory Assistance
Intelligent directory assistance is the ability to retrieve relevant subscriber records in the presence of mismatches between the query and the subscriber record. The challenges a...
Vivek Balaraman, Sutanu Chakraborti
DIAGRAMS
2004
Springer
13 years 10 months ago
Geographic Projection of Cluster Composites
A composite cluster map displays a fuzzy categorisation of geographic areas. It combines information from several sources to provide a visualisation of the significance of cluster...
Peter Kleiweg, John Nerbonne, Leonie Bosveld
TNN
1998
114views more  TNN 1998»
13 years 5 months ago
Bayesian retrieval in associative memories with storage errors
Abstract—It is well known that for finite-sized networks, onestep retrieval in the autoassociative Willshaw net is a suboptimal way to extract the information stored in the syna...
Friedrich T. Sommer, Peter Dayan