549 search results - page 34 / 110 » Computing All the Best Swap Edges Distributively |
IMC
2009
ACM
15 years 4 months ago
2009
ACM
Proximity measures quantify the closeness or similarity between nodes in a social network and form the basis of a range of applications in social sciences, business, information t...
AI
2010
Springer
14 years 9 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
72
Voted
NIPS
2001
14 years 11 months ago
2001
We describe a neural network which enhances and completes salient closed contours. Our work is different from all previous work in three important ways. First, like the input prov...
105
click to vote
AINA
2005
IEEE
15 years 3 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
CVPR
2001
IEEE
15 years 11 months ago
2001
IEEE
In this paper we describe a statistical method for the integration of an unlimited number of cues within a deformable model framework. We treat each cue as a random variable, each...