Sciweavers

29 search results - page 4 / 6
» Approximability of the Maximum Solution Problem for Certain ...
Sort
View
EUROCOLT
1999
Springer
13 years 10 months ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
14 years 17 days 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
ICDCN
2009
Springer
13 years 10 months ago
Optimizing Multi-hop Queries in ZigBee Based Multi-sink Sensor Networks
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
Bing Han, Gwendal Simon
ECCV
2010
Springer
13 years 11 months ago
Energy Minimization Under Constraints on Label Counts
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 5 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner