Sciweavers

2223 search results - page 148 / 445
» Ontological Framework for Approximation
Sort
View
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
15 years 10 months ago
A Unified Approach to Approximating Partial Covering Problems
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
Jochen Könemann, Ojas Parekh, Danny Segev
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
15 years 7 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
AAAI
1997
15 years 7 months ago
Combining Approximate Front End Signal Processing with Selective Reprocessing in Auditory Perception
When dealing with signals from complex environments, where multiple time-dependent signal signatures can interfere with each other in stochastically unpredictable ways, traditiona...
Frank Klassner, Victor R. Lesser, Hamid Nawab
IJCAI
1989
15 years 7 months ago
Approximation of Indistinct Concepts
This theory on semi-equivalence r e l a t i o n s is an important and useful tool for i n v e s t i g a t i n g c l a s s i f i c a t i o n , pattern r e c o g n i t i o n , p o l...
Zhang Mingyi
JSCIC
2007
89views more  JSCIC 2007»
15 years 6 months ago
Adjoint Recovery of Superconvergent Linear Functionals from Galerkin Approximations. The One-dimensional Case
In this paper, we extend the adjoint error correction of Pierce and Giles [SIAM Review, 42 (2000), pp. 247-264] for obtaining superconvergent approximations of functionals to Gale...
Bernardo Cockburn, Ryuhei Ichikawa