597 search results - page 49 / 120 » Homomorphisms of random paths |
116
click to vote
PLDI
2005
ACM
15 years 8 months ago
2005
ACM
We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external...
144
Voted
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
156
click to vote
TVCG
2011
14 years 10 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
114
click to vote
WEA
2007
Springer
15 years 9 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
127
click to vote
IMAMS
2003
15 years 4 months ago
2003
This paper describes a graph-spectral method for 3D surface integration. The algorithm takes as its input a 2D field of surface normal estimates, delivered, for instance, by a sh...