IJAR
2008
13 years 4 months ago
2008
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize pa...
CAGD
2006
13 years 4 months ago
2006
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to modify the scattered data fitting algorithm of [7]. Similar to that a...
CSDA
2008
13 years 4 months ago
2008
In plant pathology, in particular, and plant science, in general, experiments are often conducted to determine disease and related responses of plants to various treatments. Typic...
CSDA
2008
13 years 4 months ago
2008
Sociologists, demographers, and economists often use the index of dissimilarity, D, to describe the extent of racial, ethnic, spatial, or areal dissimilarity (or segregation) of d...
NIPS
2004
13 years 6 months ago
2004
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...
AAECC
1995
Springer
13 years 8 months ago
1995
Springer
Abstract. We look for the approximation of exp(A1 + A2) by a product in form exp(x1A1) exp(y1A2) · · · exp(xnA1) exp(ynA2). We specially are interested in minimal approximations...
ESSMAC
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classification problems, their computational com...
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
DASFAA
2005
IEEE
13 years 10 months ago
2005
IEEE
In many different application areas, e.g. space observation systems or engineering systems of world-wide operating companies, there is a need for an efficient distributed intersect...
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...