Sciweavers

376 search results - page 45 / 76
» On the Use of Virtual Evidence in Conditional Random Fields
Sort
View
CIKM
2008
Springer
13 years 9 months ago
Closing the loop in webpage understanding
The two most important tasks in information extraction from the Web are webpage structure understanding and natural language sentences processing. However, little work has been don...
Chunyu Yang, Yong Cao, Zaiqing Nie, Jie Zhou, Ji-R...
ISAAC
1998
Springer
66views Algorithms» more  ISAAC 1998»
13 years 11 months ago
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
Josep Díaz, Jordi Petit, Panagiotis Psychar...
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 7 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan
CVPR
2007
IEEE
14 years 9 months ago
Cast Shadow Removal Combining Local and Global Features
In this paper, we present a method using pixel-level information, local region-level information and global-level information to remove shadow. At the pixel-level, we employ GMM t...
Zhou Liu, Kaiqi Huang, Tieniu Tan, Liangsheng Wang
ICML
2004
IEEE
14 years 8 months ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh