10608 search results - page 1699 / 2122 » Complexity of O'Hara's Algorithm |
135
Voted
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
Semi-naive Bayesian classifiers seek to retain the numerous strengths of naive Bayes while reducing error by weakening the attribute independence assumption. Backwards Sequential ...
126
click to vote
ICML
1996
IEEE
16 years 5 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
143
click to vote
ICML
1996
IEEE
16 years 5 months ago
1996
IEEE
Finding structure in multiple streams of data is an important problem. Consider the streams of data owing from a robot's sensors, the monitors in an intensive care unit, or p...
152
click to vote
SIGSOFT
2009
ACM
16 years 5 months ago
2009
ACM
Search computing is a novel discipline whose goal is to answer complex, multi-domain queries. Such queries typically require combining in their results domain knowledge extracted ...
140
Voted
SIGSOFT
2003
ACM
16 years 5 months ago
2003
ACM
Model checking is emerging as a popular technology for reasoning about behavioral properties of a wide variety of software artifacts including: requirements models, architectural ...