Sciweavers

96 search results - page 7 / 20
» Path Hitting in Acyclic Graphs
Sort
View
PR
2007
134views more  PR 2007»
13 years 6 months ago
An elastic partial shape matching technique
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
GLOBECOM
2006
IEEE
14 years 1 months ago
Scalable Hierarchical Traceback
—Distributed Denial of Service attacks have recently emerged as one of the most potent, if not the greatest, weaknesses of the Internet. Previous solutions for this problem try t...
Arjan Durresi, Vamsi Paruchuri
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 7 months ago
On Finding Frequent Patterns in Event Sequences
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Andrea Campagna, Rasmus Pagh
DILS
2004
Springer
13 years 11 months ago
Efficient Techniques to Explore and Rank Paths in Life Science Data Sources
Abstract. Life science data sources represent a complex link-driven federation of publicly available Web accessible sources. A fundamental need for scientists today is the ability ...
Zoé Lacroix, Louiqa Raschid, Maria-Esther V...
CORR
2000
Springer
103views Education» more  CORR 2000»
13 years 7 months ago
Towards a query language for annotation graphs
The multidimensional, heterogeneous, and temporal nature of speech databases raises interesting challenges for representation and query. Recently, annotation graphs have been prop...
Steven Bird, Peter Buneman, Wang Chiew Tan