Sciweavers

742 search results - page 14 / 149
» Pattern matching for sets of segments
Sort
View
VLDB
2012
ACM
361views Database» more  VLDB 2012»
12 years 2 months ago
Answering pattern match queries in large graph databases via graph embedding
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
COMPGEOM
2010
ACM
14 years 14 days ago
On the complexity of sets of free lines and line segments among balls in three dimensions
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
Marc Glisse, Sylvain Lazard
COMPGEOM
2001
ACM
13 years 11 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
SIGIR
2003
ACM
14 years 19 days ago
SETS: search enhanced by topic segmentation
We present SETS, an architecture for efficient search in peer-to-peer networks, building upon ideas drawn from machine learning and social network theory. The key idea is to arran...
Mayank Bawa, Gurmeet Singh Manku, Prabhakar Raghav...
GD
2007
Springer
14 years 1 months ago
Minimum Level Nonplanar Patterns for Trees
We add two minimum level nonplanar (MLNP) patterns for trees to the previous set of tree patterns given by Healy et al. [3]. Neither of these patterns match any of the previous pat...
J. Joseph Fowler, Stephen G. Kobourov