Sciweavers

384 search results - page 52 / 77
» On s-hamiltonian-connected line graphs
Sort
View
JCSS
2011
95views more  JCSS 2011»
13 years 3 months ago
Hardness results for approximating the bandwidth
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
Chandan K. Dubey, Uriel Feige, Walter Unger
CAV
2011
Springer
216views Hardware» more  CAV 2011»
13 years 6 days ago
Malware Analysis with Tree Automata Inference
Abstract. The underground malware-based economy is flourishing and it is evident that the classical ad-hoc signature detection methods are becoming insufficient. Malware authors ...
Domagoj Babic, Daniel Reynaud, Dawn Song
NAR
2011
205views Computer Vision» more  NAR 2011»
12 years 11 months ago
The BRENDA Tissue Ontology (BTO): the first all-integrating ontology of all organisms for enzyme sources
BTO, the BRENDA Tissue Ontology (http://www .BTO.brenda-enzymes.org) represents a comprehensive structured encyclopedia of tissue terms. The project started in 2003 to create a co...
Marion Gremse, Antje Chang, Ida Schomburg, Andreas...
DICTA
2003
13 years 10 months ago
Two-Level Image Segmentation Based on Region and Edge Integration
Abstract. This paper introduces a two-level approach for image segmentation based on region and edge integration. Edges are first detected in the original image using a combinatio...
Qing Wu, Yizhou Yu
P2P
2009
IEEE
122views Communications» more  P2P 2009»
14 years 3 months ago
Virtual Direction Routing for Overlay Networks
The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay netwo...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...