Sciweavers

1697 search results - page 131 / 340
» On Bayesian Case Matching
Sort
View
CORR
2008
Springer
69views Education» more  CORR 2008»
13 years 11 months ago
Solving Time of Least Square Systems in Sigma-Pi Unit Networks
The solving of least square systems is a useful operation in neurocomputational modeling of learning, pattern matching, and pattern recognition. In these last two cases, the soluti...
Pierre Courrieu
CORR
2008
Springer
186views Education» more  CORR 2008»
13 years 10 months ago
Greedy Signal Recovery Review
The two major approaches to sparse recovery are L1-minimization and greedy methods. Recently, Needell and Vershynin developed Regularized Orthogonal Matching Pursuit (ROMP) that ha...
Deanna Needell, Joel A. Tropp, Roman Vershynin
JGS
2006
113views more  JGS 2006»
13 years 10 months ago
Pattern based map comparisons
Map comparison techniques based on a pixel-by-pixel comparison are useful for many purposes, but fail to reveal important aspects of map similarities and differences. In contrast, ...
Roger White
OSDI
2004
ACM
14 years 11 months ago
Automatic Misconfiguration Troubleshooting with PeerPressure
Technical support contributes 17% of the total cost of ownership of today's desktop PCs [25]. An important element of technical support is troubleshooting misconfigured appli...
Helen J. Wang, John C. Platt, Yu Chen, Ruyun Zhang...
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
14 years 4 months ago
Network Game with Attacker and Protector Entities
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...