Sciweavers

213 search results - page 40 / 43
» Regular subgraphs of random graphs
Sort
View
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
13 years 11 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
BMCBI
2006
142views more  BMCBI 2006»
13 years 7 months ago
Correlated fragile site expression allows the identification of candidate fragile genes involved in immunity and associated with
Background: Common fragile sites (cfs) are specific regions in the human genome that are particularly prone to genomic instability under conditions of replicative stress. Several ...
Angela Re, Davide Corà, Alda Maria Puliti, ...
ICCV
2009
IEEE
2301views Computer Vision» more  ICCV 2009»
15 years 18 days ago
Class Segmentation and Object Localization with Superpixel Neighborhoods
We propose a method to identify and localize object classes in images. Instead of operating at the pixel level, we advocate the use of superpixels as the basic unit of a class s...
Brian Fulkerson, Andrea Vedaldi, Stefano Soatto
ISAAC
1999
Springer
110views Algorithms» more  ISAAC 1999»
13 years 12 months ago
Online Routing in Triangulations
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
Prosenjit Bose, Pat Morin
VMV
2008
165views Visualization» more  VMV 2008»
13 years 9 months ago
Fast Global Labeling for Real-Time Stereo Using Multiple Plane Sweeps
This work presents a real-time, data-parallel approach for global label assignment on regular grids. The labels are selected according to a Markov random field energy with a Potts...
Christopher Zach, David Gallup, Jan-Michael Frahm,...