253 search results - page 39 / 51 » Random Walks with Look-Ahead in Scale-Free Random Graphs |
CLEF
2010
Springer
15 years 24 days ago
2010
Springer
In the third edition of WePS campaign we have undertaken the person name disambiguation problem referred to as a clustering task. Our aim was to make use of intrinsic link relation...
129
click to vote
MIR
2006
ACM
15 years 5 months ago
2006
ACM
The variety of features available to represent multimedia data constitutes a rich pool of information. However, the plethora of data poses a challenge in terms of feature selectio...
109
click to vote
WEBI
2005
Springer
15 years 5 months ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
104
click to vote
GLOBECOM
2010
IEEE
14 years 9 months ago
2010
IEEE
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
We introduce a novel topological formulation for contour grouping. Our grouping criterion, called untangling cycles, exploits the inherent topological 1D structure of salient cont...