Sciweavers

193 search results - page 30 / 39
» The structure of almost all graphs in a hereditary property
Sort
View
CVPR
2011
IEEE
12 years 11 months ago
Entropy Rate Superpixel Segmentation
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
Ming-Yu Liu, Oncel Tuzel, Srikumar Ramalingam, Ram...
ORDER
2008
100views more  ORDER 2008»
13 years 7 months ago
Orthogonal Surfaces and Their CP-Orders
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthog...
Stefan Felsner, Sarah Kappes
PODC
2005
ACM
14 years 1 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
BMCBI
2007
137views more  BMCBI 2007»
13 years 7 months ago
Bayesian refinement of protein functional site matching
Background: Matching functional sites is a key problem for the understanding of protein function and evolution. The commonly used graph theoretic approach, and other related appro...
Kanti V. Mardia, Vysaul B. Nyirongo, Peter J. Gree...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 24 days ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li