Sciweavers

Share
IJAR
2008
82views more  IJAR 2008»
9 years 11 months ago
Probabilistic rough set approximations
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize pa...
Yiyu Yao
CAGD
2006
90views more  CAGD 2006»
9 years 11 months ago
Local hybrid approximation for scattered data fitting with bivariate splines
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...
Oleg Davydov, Rossana Morandi, Alessandra Sestini
CSDA
2008
65views more  CSDA 2008»
9 years 11 months ago
How to compare small multivariate samples using nonparametric tests
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...
Arne C. Bathke, Solomon W. Harrar, Laurence V. Mad...
CSDA
2008
67views more  CSDA 2008»
9 years 11 months ago
How useful are approximations to mean and variance of the index of dissimilarity?
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...
Madhuri S. Mulekar, John C. Knutson, Jyoti A. Cham...
NIPS
2004
10 years 1 months ago
Face Detection - Efficient and Rank Deficient
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...
Wolf Kienzle, Gökhan H. Bakir, Matthias O. Fr...
AAECC
1995
Springer
137views Algorithms» more  AAECC 1995»
10 years 3 months ago
About Approximations of Exponentials
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...
Pierre-Vincent Koseleff
ESSMAC
2003
Springer
10 years 5 months ago
Analysis of Some Methods for Reduced Rank Gaussian Process Regression
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classification problems, their computational com...
Joaquin Quiñonero Candela, Carl Edward Rasm...
MFCS
2004
Springer
10 years 5 months ago
Approximating Boolean Functions by OBDDs
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...
Andre Gronemeier
DASFAA
2005
IEEE
136views Database» more  DASFAA 2005»
10 years 5 months ago
Distributed Intersection Join of Complex Interval Sequences
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...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
FOCS
2006
IEEE
10 years 5 months ago
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
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...
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...
books