Sciweavers

4886 search results - page 204 / 978
» Approximate Data Exchange
Sort
View
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
16 years 7 months ago
Materialized Sample Views for Database Approximation
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...
Shantanu Joshi, Chris Jermaine
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
16 years 6 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
HICSS
2009
IEEE
108views Biometrics» more  HICSS 2009»
16 years 1 months ago
Approximate Dynamic Programming in Knowledge Discovery for Rapid Response
One knowledge discovery problem in the rapid response setting is the cost of learning which patterns are indicative of a threat. This typically involves a detailed follow-through,...
Peter Frazier, Warren B. Powell, Savas Dayanik, Pa...
INFOCOM
2008
IEEE
16 years 24 days ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
16 years 21 days ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...