Sciweavers

556 search results - page 102 / 112
» Pair Programming: Not for Everyone
Sort
View
BIBM
2008
IEEE
112views Bioinformatics» more  BIBM 2008»
14 years 2 months ago
Fast Alignments of Metabolic Networks
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
Qiong Cheng, Piotr Berman, Robert W. Harrison, Ale...
NOCS
2008
IEEE
14 years 2 months ago
Debugging Distributed-Shared-Memory Communication at Multiple Granularities in Networks on Chip
We present a methodology to debug a SOC by concentrating on its communication. Our extended communication model includes a) multiple signal groups per interface protocol at each I...
Bart Vermeulen, Kees Goossens, Siddharth Umrani
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
14 years 2 months ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...
ANSS
2007
IEEE
14 years 2 months ago
JANE - The Java Ad Hoc Network Development Environment
This work describes a Java based development platform which is intended to support ad hoc network researchers in application and protocol design. Software development within this ...
Daniel Görgen, Hannes Frey, Christian Hiedels
BIBE
2007
IEEE
128views Bioinformatics» more  BIBE 2007»
14 years 2 months ago
QOMA2: Optimizing the alignment of many sequences
Abstract—We consider the problem of aligning multiple protein sequences with the goal of maximizing the SP (Sum-of-Pairs) score, when the number of sequences is large. The QOMA (...
Xu Zhang, Tamer Kahveci