Sciweavers

1671 search results - page 251 / 335
» On the Covering Steiner Problem
Sort
View
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 7 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
ORL
2006
105views more  ORL 2006»
15 years 5 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
TALG
2008
152views more  TALG 2008»
15 years 5 months ago
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
Guy Even, Retsef Levi, Dror Rawitz, Baruch Schiebe...

Book
5396views
17 years 4 months ago
Markov Random Field Modeling in Computer Vision
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
Stan Z. Li
CVPR
2009
IEEE
1385views Computer Vision» more  CVPR 2009»
17 years 1 months ago
Distributed Multi-Target Tracking In A Self-Configuring Camera Network
This paper deals with the problem of tracking multiple targets in a distributed network of self-configuring pan-tilt-zoom cameras. We focus on applications where events unfold over...
Amit K. Roy Chowdhury, Bi Song, Cristian Soto