Sciweavers

514 search results - page 32 / 103
» On enumerating all minimal solutions of feedback problems
Sort
View
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
16 years 1 months ago
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
15 years 6 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
STACS
2010
Springer
16 years 1 months ago
Planar Subgraph Isomorphism Revisited
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
Frederic Dorn
CVPR
2007
IEEE
16 years 15 days ago
Multiple Target Tracking Using Spatio-Temporal Markov Chain Monte Carlo Data Association
We propose a framework for general multiple target tracking, where the input is a set of candidate regions in each frame, as obtained from a state of the art background learning, ...
Qian Yu, Gérard G. Medioni, Isaac Cohen
BIRTHDAY
2006
Springer
15 years 10 months ago
Optimal Flow Distribution Among Multiple Channels with Unknown Capacities
Consider a simple network flow problem in which there are n channels directed from a source to a sink. The channel capacities are unknown and we wish to determine a feasible netwo...
Richard M. Karp, Till Nierhoff, Till Tantau