1402 search results - page 132 / 281 » Searching Cycle-Disjoint Graphs |
SAC
2006
ACM
15 years 4 months ago
2006
ACM
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
We present a family of measures of proximity of an arbitrary node in a directed graph to a pre-specified subset of nodes, called the anchor. Our measures are based on three differ...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— This paper proposes a necessary and sufficient condition for parallel grasps. We extend the use of this condition to the task of regrasp planning. In particular, we propose a ...
129
click to vote
CIKM
2009
Springer
15 years 2 months ago
2009
Springer
Traditional desktop search engines only support keyword based search that needs exact keyword matching to find resources. However, users generally have a vague picture of what is...
180
click to vote
ICDE
2009
IEEE
15 years 12 months ago
2009
IEEE
Workflows are widely used for representing business processes, web services, scientific experiments, and activities in daily life, like recipes. There is an increasing need for peo...