420 search results - page 37 / 84 » Search on High Degree Graphs |
81
Voted
ISCIS
2009
Springer
15 years 7 months ago
2009
Springer
—In this paper, we combine graph coloring heuristics, namely largest degree and saturation degree with the concept of a heuristic modifier under the framework of squeaky wheel op...
185
click to vote
ICDE
2007
IEEE
16 years 2 months ago
2007
IEEE
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
129
Voted
WWW
2010
ACM
15 years 7 months ago
2010
ACM
An unsupervised clustering of the webpages on a website is a primary requirement for most wrapper induction and automated data extraction methods. Since page content can vary dras...
118
Voted
CLUSTER
2003
IEEE
15 years 6 months ago
2003
IEEE
In this paper we analyze the I/O access patterns of a widely-used biological sequence search tool and implement two variations that employ parallel-I/O for data access based on PV...
220
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...