Sciweavers

1029 search results - page 39 / 206
» Dependence Anti Patterns
Sort
View
JMLR
2012
11 years 10 months ago
Universal Measurement Bounds for Structured Sparse Signal Recovery
Standard compressive sensing results state that to exactly recover an s sparse signal in Rp , one requires O(s · log p) measurements. While this bound is extremely useful in prac...
Nikhil S. Rao, Ben Recht, Robert D. Nowak
TPHOL
2003
IEEE
14 years 28 days ago
A Coverage Checking Algorithm for LF
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
Carsten Schürmann, Frank Pfenning
KDD
1995
ACM
95views Data Mining» more  KDD 1995»
13 years 11 months ago
On Subjective Measures of Interestingness in Knowledge Discovery
One of the central problems in the field of knowledge discovery is the development of good measures of interestingness of discovered patterns. Such measures of interestingness are...
Abraham Silberschatz, Alexander Tuzhilin
ICPR
2000
IEEE
13 years 11 months ago
A Bayesian Approach to Object Identification in Pattern Recognition
We present a new Bayesian approach to object identification: variants. By object identification we mean the detection of the member (regular variant) of a given statistical popula...
Gunter Ritter, María Teresa Gallegos
BC
2008
89views more  BC 2008»
13 years 7 months ago
Complex evolution of spike patterns during burst propagation through feed-forward networks
Abstract Stable signal transmission is crucial for information processing by the brain. Synfire-chains, defined as feedforward networks of spiking neurons, are a well-studied class...
Jun-nosuke Teramae, Tomoki Fukai