Sciweavers

1154 search results - page 33 / 231
» On the editing distance of graphs
Sort
View
HPCC
2005
Springer
14 years 2 months ago
A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
Doruk Bozdag, Ümit V. Çatalyürek,...
VLDB
1999
ACM
188views Database» more  VLDB 1999»
14 years 28 days ago
Comparing Hierarchical Data in External Memory
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
Sudarshan S. Chawathe
WALCOM
2010
IEEE
230views Algorithms» more  WALCOM 2010»
14 years 3 months ago
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions
Abstract. Arc-annotated sequences are useful for representing structural information of RNAs and have been extensively used for comparing RNA structures in both terms of sequence a...
Guillaume Blin, Sylvie Hamel, Stéphane Vial...
ICMCS
2006
IEEE
144views Multimedia» more  ICMCS 2006»
14 years 2 months ago
Generating a Time Shrunk Lecture Video by Event Detection
Streaming a lecture video via the Internet is important for Elearning. We have developed a system that generates a lecture video using virtual camerawork based on shooting techniq...
Takao Yokoi, Hironobu Fujiyoshi
CGF
2005
232views more  CGF 2005»
13 years 8 months ago
Algorithms for Interactive Editing of Level Set Models
Level set models combine a low-level volumetric representation, the mathematics of deformable implicit surfaces, and powerful, robust numerical techniques to produce a novel appro...
Ken Museth, David E. Breen, Ross T. Whitaker, Sean...