Sciweavers

478 search results - page 66 / 96
» Structural Properties of Twin-Free Graphs
Sort
View
BIBE
2005
IEEE
115views Bioinformatics» more  BIBE 2005»
14 years 3 months ago
GOMIT: A Generic and Adaptive Annotation Algorithm Based on Gene Ontology Term Distributions
We address the issue of providing highly informative annotations using information revealed by the structured vocabularies of Gene Ontology (GO). For a target, a set of candidate ...
In-Yee Lee, Jan-Ming Ho, Ming-Syan Chen
ISAAC
2004
Springer
107views Algorithms» more  ISAAC 2004»
14 years 3 months ago
On the Hardness and Easiness of Random 4-SAT Formulas
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
Andreas Goerdt, André Lanka
ICRA
2003
IEEE
108views Robotics» more  ICRA 2003»
14 years 3 months ago
PCG: a foothold selection algorithm for spider robot locomotion in 2D tunnels
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
Amir Shapiro, Elon Rimon
IPPS
2002
IEEE
14 years 2 months ago
Dominating Set Based Bluetooth Scatternet Formation with Localized Maintenance
This paper addresses the problem of scatternet formation and maintenance for multi-hop Bluetooth based personal area and ad hoc networks with minimal communication overhead. Each ...
Ivan Stojmenovic
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
13 years 1 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...