Sciweavers

1290 search results - page 53 / 258
» Popular Matchings: Structure and Algorithms
Sort
View
SIBGRAPI
1999
IEEE
15 years 8 months ago
Deterministic Texture Analysis and Synthesis Using Tree Structure Vector Quantization
Texture analysis and synthesis is very important for computer graphics, vision, and image processing. This paper describes an algorithm which can produce new textures with a matchi...
Li-Yi Wei
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
15 years 10 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
SEMWEB
2005
Springer
15 years 10 months ago
Semantic Browsing of Digital Collections
Visiting museums is an increasingly popular pastime. Studies have shown that visitors can draw on their museum experience, long after their visit, to learn new things in practical ...
Trevor D. Collins, Paul Mulholland, Zdenek Zdr&aac...
ATAL
2008
Springer
15 years 6 months ago
Expediting RL by using graphical structures
The goal of Reinforcement learning (RL) is to maximize reward (minimize cost) in a Markov decision process (MDP) without knowing the underlying model a priori. RL algorithms tend ...
Peng Dai, Alexander L. Strehl, Judy Goldsmith
ECCV
2008
Springer
16 years 6 months ago
Learning Two-View Stereo Matching
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching between two uncalibrated wide-baseline images by exploiting the results of sparse...
Jianxiong Xiao, Jingni Chen, Dit-Yan Yeung, Long Q...