Sciweavers

60 search results - page 8 / 12
» On Packing Colorings of Distance Graphs
Sort
View
BMCBI
2010
86views more  BMCBI 2010»
13 years 7 months ago
Protein binding hot spots and the residue-residue pairing preference: a water exclusion perspective
Background: A protein binding hot spot is a small cluster of residues tightly packed at the center of the interface between two interacting proteins. Though a hot spot constitutes...
Qian Liu, Jinyan Li
ISBI
2009
IEEE
14 years 2 months ago
Cell Tracking and Segmentation in Electron Microscopy Images Using Graph Cuts
Understanding neural connectivity and structures in the brain requires detailed 3D anatomical models, and such an understanding is essential to the study of the nervous system. Ho...
Huei-Fang Yang, Yoonsuck Choe
SODA
2004
ACM
98views Algorithms» more  SODA 2004»
13 years 8 months ago
End-to-end packet-scheduling in wireless ad-hoc networks
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
ICCV
2007
IEEE
14 years 9 months ago
Multi-Object Tracking Through Clutter Using Graph Cuts
The standard graph cut technique is a robust method for globally optimal image segmentations. However, because of its global nature, it is prone to capture outlying areas similar ...
Allen Tannenbaum, James G. Malcolm, Yogesh Rathi
EJC
2008
13 years 7 months ago
Grad and classes with bounded expansion II. Algorithmic aspects
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
Jaroslav Nesetril, Patrice Ossona de Mendez