Sciweavers

618 search results - page 37 / 124
» Short cycle connectivity
Sort
View
DEXAW
2004
IEEE
105views Database» more  DEXAW 2004»
15 years 1 months ago
C2P2: A Peer-to-Peer Network for On-Demand Automobile Information Services
This short paper outlines challenges of delivering continuous media and traffic information to mobile Car-to-Car Peer-to-Peer (C2P2) network of devices. We analyze network connect...
Shahram Ghandeharizadeh, Bhaskar Krishnamachari
ACS
2007
14 years 9 months ago
More on Configurations in Priestley Spaces, and Some New Problems
Abstract. Prohibiting configurations (≡ induced finite connected posets) in Priestley spaces and properties of the associated classes of distributive lattices, and the related ...
Richard N. Ball, Ales Pultr, Jirí Sichler
BMCBI
2010
183views more  BMCBI 2010»
14 years 9 months ago
SOPRA: Scaffolding algorithm for paired reads via statistical optimization
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
Adel Dayarian, Todd P. Michael, Anirvan M. Sengupt...
MDAFA
2004
Springer
178views Hardware» more  MDAFA 2004»
15 years 3 months ago
Model Bus: Towards the Interoperability of Modelling Tools
MDA software development requires the interoperability of a wide range of modelling services (operations taking models as inputs and outputs), such as model edition, model transfor...
Xavier Blanc, Marie-Pierre Gervais, Prawee Sriplak...
DAM
2010
167views more  DAM 2010»
14 years 9 months ago
A new characterization of P6-free graphs
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
Pim van 't Hof, Daniël Paulusma