Sciweavers

1760 search results - page 172 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
CPAIOR
2011
Springer
12 years 11 months ago
Upgrading Shortest Paths in Networks
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
Bistra N. Dilkina, Katherine J. Lai, Carla P. Gome...
IJCAI
2007
13 years 9 months ago
Concept Sampling: Towards Systematic Selection in Large-Scale Mixed Concepts in Machine Learning
This paper addresses the problem of concept sampling. In many real-world applications, a large collection of mixed concepts is available for decision making. However, the collecti...
Yi Zhang 0010, Xiaoming Jin
SPIRE
2005
Springer
14 years 1 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
TIT
2002
126views more  TIT 2002»
13 years 7 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy
ICIP
2003
IEEE
14 years 9 months ago
A Bayesian framework for Gaussian mixture background modeling
Background subtraction is an essential processing component for many video applications. However, its development has largely been application driven and done in ad hoc manners. I...
Dar-Shyang Lee, Jonathan J. Hull, Berna Erol