Sciweavers

250 search results - page 20 / 50
» Verifying Tolerant Systems Using Polynomial Approximations
Sort
View
SEMWEB
2010
Springer
14 years 7 months ago
Combining Approximation and Relaxation in Semantic Web Path Queries
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
Alexandra Poulovassilis, Peter T. Wood
VLDB
2000
ACM
155views Database» more  VLDB 2000»
15 years 1 months ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan
TSP
2010
14 years 4 months ago
Quasi-interpolation by means of filter-banks
We consider the problem of approximating a regular function f(t) from its samples, f(nT), taken in a uniform grid. Quasi-interpolation schemes approximate f(t) with a dilated versi...
Gerardo Pérez-Villalón
RC
2002
70views more  RC 2002»
14 years 9 months ago
On Existence and Uniqueness Verification for Non-Smooth Functions
Given an approximate solution to a nonlinear system of equations at which the Jacobi matrix is nonsingular, and given that the Jacobi matrix is continuous in a region about this ap...
R. Baker Kearfott
102
Voted
HIPC
2007
Springer
15 years 1 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri