Sciweavers

384 search results - page 52 / 77
» On s-hamiltonian-connected line graphs
Sort
View
105
Voted
JCSS
2011
95views more  JCSS 2011»
14 years 7 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»
14 years 4 months 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
107
Voted
NAR
2011
205views Computer Vision» more  NAR 2011»
14 years 3 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...
116
Voted
DICTA
2003
15 years 1 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
112
Voted
P2P
2009
IEEE
122views Communications» more  P2P 2009»
15 years 7 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...