3268 search results - page 323 / 654 » The hub number of a graph |
234
click to vote
IJDAR
2006
15 years 6 months ago
2006
Evaluation of object detection algorithms is a non-trivial task: a detection result is usually evaluated by comparing the bounding box of the detected object with the bounding box...
188
click to vote
IM
2007
15 years 6 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
307
click to vote
ICDE
2008
IEEE
16 years 8 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...
186
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
199
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...