Sciweavers

102291 search results - page 20257 / 20459
» Computability in Computational Geometry
Sort
View
ML
2000
ACM
154views Machine Learning» more  ML 2000»
15 years 4 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
MOC
2000
105views more  MOC 2000»
15 years 4 months ago
On the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed problems
The iteratively regularized Gauss-Newton method is applied to compute the stable solutions to nonlinear ill-posed problems F (x) = y when the data y is given approximately by y wit...
Jin Qi-nian
NAR
2000
172views more  NAR 2000»
15 years 4 months ago
The Molecular Biology Database Collection: an online compilation of relevant database resources
The Molecular Biology Database Collection represents an effort geared at making molecular biology database resources more accessible to biologists. This online resource, available...
Andreas D. Baxevanis
NJC
2000
169views more  NJC 2000»
15 years 4 months ago
A Type System for Bounded Space and Functional In-Place Update
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
Martin Hofmann
ETT
2002
89views Education» more  ETT 2002»
15 years 4 months ago
Delay analysis of a probabilistic priority discipline
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
Yuming Jiang, Chen-Khong Tham, Chi Chung Ko
« Prev « First page 20257 / 20459 Last » Next »