5316 search results - page 42 / 1064 » Which Search Problems Are Random |
128
click to vote
SLS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
94
Voted
CSE
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—Extensive work has been devoted to private information retrieval and privacy preserving data mining. To protect user privacy from search engines, however, most current a...
107
Voted
INFOSCALE
2006
ACM
15 years 6 months ago
2006
ACM
— We consider the following situation for a given large-scale network: Starting from an initial node we move to its neighbor node and repeat that until reaching a target node. Ho...
104
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with the...
86
Voted
IPMI
2005
Springer
16 years 1 months ago
2005
Springer
This paper presents a general graph-theoretic technique for simultaneously segmenting multiple closed surfaces in volumetric images, which employs a novel graph-construction scheme...