191 search results - page 11 / 39 » Extending the Relational Algebra to Support Transaction Time |
165
Voted
CORR
1999
Springer
15 years 3 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
129
click to vote
BNCOD
2004
15 years 5 months ago
2004
Extending relational database functionality to include data mining primitives is one step towards the greater goal of more closely integrated database and mining systems. This pape...
134
click to vote
MST
2010
14 years 10 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
109
Voted
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
Analytic applications from various industrial sectors have specific attributes and requirements including relatively long processing time, parallelization, multiple interactive in...
164
Voted
CIVR
2008
Springer
15 years 5 months ago
2008
Springer
Storyboards, a grid layout of thumbnail images as surrogates representing video, have received much attention in video retrieval interfaces and published studies through the years...