Sciweavers

4886 search results - page 106 / 978
» Approximate Data Exchange
Sort
View
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
15 years 10 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
129
Voted
STACS
2001
Springer
15 years 9 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
TIP
2011
170views more  TIP 2011»
14 years 12 months ago
A New Hybrid Method for Image Approximation Using the Easy Path Wavelet Transform
The Easy Path Wavelet Transform (EPWT) has recently been proposed by one of the authors as a tool for sparse representations of bivariate functions from discrete data, in particul...
Gerlind Plonka, Stefanie Tenorth, Daniela Rosca
144
Voted
ICPR
2006
IEEE
16 years 6 months ago
Object Localization Based on Directional Information: Case of 2D Raster Data
A directional spatial relationship to a reference object (e.g., "east of the post office") can be represented by a spatial template. The template partitions the space in...
JingBo Ni, Pascal Matsakis, Xin Wang
GIS
2006
ACM
16 years 6 months ago
Computing longest duration flocks in trajectory data
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
Joachim Gudmundsson, Marc J. van Kreveld