Sciweavers

2030 search results - page 218 / 406
» Extremal Problems of Information Combining
Sort
View
TSMC
1998
78views more  TSMC 1998»
15 years 5 months ago
Automata learning and intelligent tertiary searching for stochastic point location
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
B. John Oommen, Govindachari Raghunath
SCHOLARPEDIA
2008
110views more  SCHOLARPEDIA 2008»
15 years 5 months ago
Luce's choice axiom
A geometric approach is introduced to explain phenomena that can arise with Luce's choice axiom; e.g., differences occur when determining the likelihood of a ranking by start...
Duncan Luce
CVPR
2010
IEEE
1373views Computer Vision» more  CVPR 2010»
16 years 2 months ago
Harmony Potentials for Joint Classification and Segmentation
Hierarchical conditional random fields have been successfully applied to object segmentation. One reason is their ability to incorporate contextual information at different scales....
Xavier Boix, Josep M. Gonfaus, Joost van de Weijer...
197
Voted
PAMI
2010
260views more  PAMI 2010»
15 years 4 months ago
Unsupervised Object Segmentation with a Hybrid Graph Model (HGM)
—In this work, we address the problem of performing class-specific unsupervised object segmentation, i.e., automatic segmentation without annotated training images. Object segmen...
Guangcan Liu, Zhouchen Lin, Yong Yu, Xiaoou Tang
SPIRE
2010
Springer
15 years 4 months ago
String Matching with Variable Length Gaps
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
Philip Bille, Inge Li Gørtz, Hjalte Wedel V...