Sciweavers

173 search results - page 35 / 35
» Complexity and Approximation Results for the Connected Verte...
Sort
View
BC
2005
127views more  BC 2005»
13 years 4 months ago
Computational modeling and exploration of contour integration for visual saliency
Abstract Weproposeacomputationalmodelofcontourintegration for visual saliency. The model uses biologically plausible devices to simulate how the representations of elements aligned...
T. Nathan Mundhenk, Laurent Itti
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 5 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
BMCBI
2010
178views more  BMCBI 2010»
13 years 4 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...