Sciweavers

6598 search results - page 370 / 1320
» Graph Theory with Applications
Sort
View
ALMOB
2006
138views more  ALMOB 2006»
15 years 6 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
INFOCOM
2005
IEEE
16 years 10 days ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
DAC
2003
ACM
16 years 7 months ago
Optimal integer delay budgeting on directed acyclic graphs
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
Elaheh Bozorgzadeh, Soheil Ghiasi, Atsushi Takahas...
ICDM
2005
IEEE
148views Data Mining» more  ICDM 2005»
16 years 10 days ago
A Graph-Ranking Algorithm for Geo-Referencing Documents
This paper presents an application of PageRank for assigning documents with a corresponding geographical scope. We describe the technique in detail, together with its theoretical ...
Bruno Martins, Mário J. Silva
BIRD
2008
Springer
119views Bioinformatics» more  BIRD 2008»
15 years 8 months ago
Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model
The swap matching problem consists if finding a pattern in a text, while allowing for transpositions in the pattern. A new approach using a graph-theoretic model was presented in [...
Pavlos Antoniou, Costas S. Iliopoulos, Inuka Jayas...