633 search results - page 100 / 127 » A Classified and Comparative Study of Edge Detection Algorit... |
130
click to vote
ECCC
2006
15 years 4 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
149
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We present a random field based model for stereo vision with explicit occlusion labeling in a probabilistic framework. The model employs non-parametric cost functions that can be ...
129
click to vote
CSE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
144
click to vote
APGV
2008
ACM
15 years 6 months ago
2008
ACM
We present a method for image interpolation which is able to create high-quality, perceptually convincing transitions between recorded images. By implementing concepts derived fro...
185
Voted
INLG
2010
Springer
15 years 2 months ago
2010
Springer
The generation of referring expressions (GRE), an important subtask of Natural Language Generation (NLG) is to generate phrases that uniquely identify domain entities. Until recen...