1297 search results - page 109 / 260 » Dynamic Object Process Graphs |
113
Voted
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
103
Voted
MM
2006
ACM
15 years 8 months ago
2006
ACM
Recently, interactive image cutout technique becomes prevalent for image segmentation problem due to its easy-to-use nature. However, most existing stroke-based interactive object...
228
Voted
GIS
2006
ACM
16 years 3 months ago
2006
ACM
The result of a distance join operation on two sets of objects R, S on a spatial network G is a set P of object pairs <p, q>, p R, q S such that the distance of an object ...
135
click to vote
NIPS
1996
15 years 3 months ago
1996
Predictions oflifetimesofdynamicallyallocated objects can be used to improve time and space e ciency of dynamic memory management in computer programs. Barrett and Zorn 1993] used...
138
click to vote
JSS
2007
15 years 2 months ago
2007
In object oriented database management systems, clustering has proven to be one of the most effective performance enhancement techniques. Existing clustering algorithms are mainly...