13 search results - page 3 / 3 » Monotonicity of Non-deterministic Graph Searching |
116
Voted
WG
1994
Springer
15 years 5 months ago
1994
Springer
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
226
Voted
ICDE
2008
IEEE
16 years 2 months ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
106
Voted
KDD
2004
ACM
16 years 1 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...