773 search results - page 39 / 155 » Traversing the Machining Graph |
185
click to vote
ICDE
2008
IEEE
15 years 11 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...
SAC
2006
ACM
15 years 3 months ago
2006
ACM
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
101
click to vote
SOCIALCOM
2010
14 years 7 months ago
2010
A representation of the World Wide Web as a directed graph, with vertices representing web pages and edges representing hypertext links, underpins the algorithms used by web search...
104
click to vote
ICCS
2005
Springer
15 years 3 months ago
2005
Springer
A machine learning technique for handling scenarios of interaction between conflicting agents is suggested. Scenarios are represented by directed graphs with labeled vertices (for ...
159
Voted
MLQ
2011
14 years 4 months ago
2011
Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G-independent Borel sets that cov...