Sciweavers

4926 search results - page 21 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
ISAAC
2007
Springer
89views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Unifying Two Graph Decompositions with Modular Decomposition
We introduces the umodules, a generalization of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures...
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy,...
ICDE
2002
IEEE
121views Database» more  ICDE 2002»
14 years 9 months ago
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching...
Sergey Melnik, Hector Garcia-Molina, Erhard Rahm
ICASSP
2008
IEEE
14 years 2 months ago
Joint base-calling of two DNA sequences with factor graphs
—Automated estimation of DNA base-sequences is an important step in genomics and in many other emerging fields in biological and medical sciences. Current automated sequencers p...
Xiaomeng Shi, Desmond S. Lun, Jim Meldrim, Ralf K&...
ATAL
2005
Springer
14 years 1 months ago
Discovering strategic multi-agent behavior in a robotic soccer domain
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
Andraz Bezek
SAC
2002
ACM
13 years 7 months ago
A mobility and traffic generation framework for modeling and simulating ad hoc communication networks
We present a generic mobility and traffic generation framework that can be incorporated into a tool for modeling and simulating large scale ad hoc networks. Three components of thi...
Christopher L. Barrett, Madhav V. Marathe, James P...