Sciweavers

2088 search results - page 181 / 418
» The Probabilistic Method
Sort
View
145
Voted
PAMI
2010
190views more  PAMI 2010»
15 years 1 months ago
OBJCUT: Efficient Segmentation Using Top-Down and Bottom-Up Cues
—We present a probabilistic method for segmenting instances of a particular object category within an image. Our approach overcomes the deficiencies of previous segmentation tech...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
CORR
2008
Springer
125views Education» more  CORR 2008»
15 years 3 months ago
Adversary lower bounds for nonadaptive quantum algorithms
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
Pascal Koiran, Jürgen Landes, Natacha Portier...
IJCNLP
2005
Springer
15 years 9 months ago
Chunking Using Conditional Random Fields in Korean Texts
We present a method of chunking in Korean texts using conditional random fields (CRFs), a recently introduced probabilistic model for labeling and segmenting sequence of data. In a...
Yong-Hun Lee, Mi-Young Kim, Jong-Hyeok Lee
148
Voted
BIOINFORMATICS
2012
13 years 5 months ago
Epigenetic priors for identifying active transcription factor binding sites
Motivation Accurate knowledge of the genome-wide binding of transcription factors in a particular cell type or under a particular condition is necessary for understanding transcri...
Gabriel Cuellar-Partida, Fabian A. Buske, Robert C...
CSR
2011
Springer
14 years 7 months ago
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
Daniil Musatov