Sciweavers

2485 search results - page 387 / 497
» Time Bounded Frequency Computations
Sort
View
ICDE
2011
IEEE
234views Database» more  ICDE 2011»
12 years 11 months ago
Massively parallel XML twig filtering using dynamic programming on FPGAs
Abstract— In recent years, XML-based Publish-Subscribe Systems have become popular due to the increased demand of timely event-notification. Users (or subscribers) pose complex ...
Roger Moussalli, Mariam Salloum, Walid A. Najjar, ...
CORR
2012
Springer
176views Education» more  CORR 2012»
12 years 3 months ago
Capturing Topology in Graph Pattern Matching
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...
SIAMCOMP
2012
11 years 10 months ago
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...
COMGEO
2008
ACM
13 years 8 months ago
Optimal location of transportation devices
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
Jean Cardinal, Sébastien Collette, Ferran H...
ICPR
2008
IEEE
14 years 9 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson