4966 search results - page 195 / 994 » its 2010 |
190
click to vote
COMPIMAGE
2010
Springer
16 years 1 months ago
2010
Springer
We propose a method that we call auto-adaptive convolution which extends the classical notion of convolution in pictures analysis to function analysis on a discrete set. We define...
156
click to vote
FASE
2010
Springer
16 years 1 months ago
2010
Springer
f abstraction, providing an effective way to discover a Web service based on its interface. Awards and Scholarships - Ontario Graduate Scholarship (OGS), 2008 - Ontario Graduate S...
197
click to vote
ICDE
2010
IEEE
15 years 12 months ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
301
click to vote
ICPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We propose a novel Markovian segmentation
model which takes into account edge information. By construction,
the model uses only pairwise interactions and its
energy is submodula...
183
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...