Sciweavers

553 search results - page 40 / 111
» Cover Contact Graphs
Sort
View
MOBIQUITOUS
2007
IEEE
15 years 4 months ago
Assessing Standard and Inverted Skip Graphs Using Multi-Dimensional Range Queries and Mobile Nodes
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...
Gregory J. Brault, Christopher J. Augeri, Barry E....
RECOMB
2006
Springer
15 years 11 months ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger
CPM
2004
Springer
168views Combinatorics» more  CPM 2004»
15 years 4 months ago
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robe...
ASUNAM
2011
IEEE
13 years 10 months ago
Content-based Modeling and Prediction of Information Dissemination
—Social and communication networks across the world generate vast amounts of graph-like data each day. The modeling and prediction of how these communication structures evolve ca...
Kathy Macropol, Ambuj K. Singh
GLVLSI
2009
IEEE
159views VLSI» more  GLVLSI 2009»
15 years 5 months ago
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
Renshen Wang, Chung-Kuan Cheng