Sciweavers

720 search results - page 118 / 144
» Nonrepetitive colorings of graphs
Sort
View
BMCBI
2010
137views more  BMCBI 2010»
13 years 7 months ago
TreeGraph 2: Combining and visualizing evidence from different phylogenetic analyses
Background: Today it is common to apply multiple potentially conflicting data sources to a given phylogenetic problem. At the same time, several different inference techniques are...
Ben C. Stöver, Kai F. Müller
CVPR
2010
IEEE
14 years 4 months ago
Geodesic Graph Cut for Interactive Image Segmentation
Interactive segmentation is useful for selecting objects of interest in images and continues to be a topic of much study. Methods that grow regions from foreground/background seed...
Brian Price, Bryan Morse, Scott Cohen
PAMI
2007
127views more  PAMI 2007»
13 years 7 months ago
Stereo Correspondence with Occlusion Handling in a Symmetric Patch-Based Graph-Cuts Model
—A novel patch-based correspondence model is presented in this paper. Many segment-based correspondence approaches have been proposed in recent years. Untextured pixels and bound...
Yi Deng, Qiong Yang, Xueyin Lin, Xiaoou Tang
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 7 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
ECRTS
2008
IEEE
14 years 2 months ago
Temporal Analysis for Adapting Concurrent Applications to Embedded Systems
Embedded services and applications that interact with the real world often, over time, need to run on different kinds of hardware (low-cost microcontrollers to powerful multicore ...
Sibin Mohan, Johannes Helander