Sciweavers

2192 search results - page 288 / 439
» Algorithms for Challenging Motif Problems
Sort
View
192
Voted
PAMI
2012
13 years 6 months ago
CPMC: Automatic Object Segmentation Using Constrained Parametric Min-Cuts
—We present a novel framework to generate and rank plausible hypotheses for the spatial extent of objects in images using bottom-up computational processes and mid-level selectio...
João Carreira, Cristian Sminchisescu
132
Voted
CVPR
2003
IEEE
16 years 5 months ago
Object Removal by Exemplar-Based Inpainting
A new algorithm is proposed for removing large objects from digital images. The challenge is to fill in the hole that is left behind in a visually plausible way. In the past, this...
Antonio Criminisi, Kentaro Toyama, Patrick P&eacut...
134
Voted
ATAL
2009
Springer
15 years 10 months ago
Generalized model learning for reinforcement learning in factored domains
Improving the sample efficiency of reinforcement learning algorithms to scale up to larger and more realistic domains is a current research challenge in machine learning. Model-ba...
Todd Hester, Peter Stone
149
Voted
ICPR
2008
IEEE
15 years 10 months ago
Robust outdoor text detection using text intensity and shape features
Recognizing texts from camera images is a known hard problem because of the difficulties in text segmentation from the varied and complicated backgrounds. In this paper, we propo...
Zongyi Liu, Sudeep Sarkar
117
Voted
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 3 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...