Sciweavers

989 search results - page 127 / 198
» Approximating the Pareto optimal set using a reduced set of ...
Sort
View
ECCV
2010
Springer
13 years 11 months ago
Optimal Contour Closure by Superpixel Grouping
Abstract. Detecting contour closure, i.e., finding a cycle of disconnected contour fragments that separates an object from its background, is an important problem in perceptual gro...
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 3 months ago
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
Yi Gai, Bhaskar Krishnamachari, Rahul Jain
ICASSP
2009
IEEE
14 years 2 months ago
Q-SIFT: Efficient feature descriptors for distributed camera calibration
We consider camera self-calibration, i.e. the estimation of parameters for camera sensors, in the setting of a visual sensor network where the sensors are distributed and energy-c...
Chao Yu, Gaurav Sharma
SIGCOMM
2012
ACM
11 years 10 months ago
Optimizing cost and performance for content multihoming
Many large content publishers use multiple content distribution networks to deliver their content, and many industrial systems have become available to help a broader set of conte...
Hongqiang Harry Liu, Ye Wang, Yang Richard Yang, H...
BMCBI
2010
117views more  BMCBI 2010»
13 years 8 months ago
New decoding algorithms for Hidden Markov Models using distance measures on labellings
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
Daniel G. Brown 0001, Jakub Truszkowski