5606 search results - page 453 / 1122 » Randomization Techniques for Graphs. |
175
click to vote
ICWS
2007
IEEE
15 years 8 months ago
2007
IEEE
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...
149
click to vote
LREC
2008
15 years 8 months ago
2008
This paper presents the results of a graph-based method for performing knowledge-based Word Sense Disambiguation (WSD). The technique exploits the structural properties of the gra...
284
click to vote
PAMI
2006
15 years 6 months ago
2006
In this paper we introduce new type of variational segmentation cost functions and associated active contour methods that are based on pairwise similarities or dissimilarities of t...
194
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
For many tracking and surveillance applications, background subtraction provides an effective means of segmenting objects moving in front of a static background. Researchers have ...
205
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...