Sciweavers

1480 search results - page 70 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
14 years 4 months ago
A Knapsack Secretary Problem with Applications
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...
CVPR
2003
IEEE
15 years 11 days ago
PAMPAS: Real-Valued Graphical Models for Computer Vision
Probabilistic models have been adopted for many computer vision applications, however inference in highdimensional spaces remains problematic. As the statespace of a model grows, ...
Michael Isard
NETWORK
2010
122views more  NETWORK 2010»
13 years 5 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
14 years 3 months ago
Unbalanced Graph Cuts
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
Ara Hayrapetyan, David Kempe, Martin Pál, Z...
OL
2011
242views Neural Networks» more  OL 2011»
13 years 5 months ago
On connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...