2370 search results - page 176 / 474 » The Characterization of Data-Accumulating Algorithms |
75
Voted
COLT
1999
Springer
15 years 2 months ago
1999
Springer
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
WG
1993
Springer
15 years 2 months ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
CODES
2004
IEEE
15 years 1 months ago
2004
IEEE
We present a analytical framework to identify the tradeoffs and performance impacts associated with different SoC platform configurations in the specific context of implementing m...
100
click to vote
CIVR
2006
Springer
15 years 1 months ago
2006
Springer
We propose a novel Bayesian learning framework of hierarchical mixture model by incorporating prior hierarchical knowledge into concept representations of multi-level concept struc...
74
Voted
SAS
2000
Springer
15 years 1 months ago
2000
Springer
Computing invariants is the key issue in the analysis of infinite-state systems whether analysis means testing, verification or parameter synthesis. In particular, methods that all...