1403 search results - page 186 / 281 » Set cover algorithms for very large datasets |
147
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
152
click to vote
CHI
2009
ACM
16 years 1 months ago
2009
ACM
Eliciting user preferences for large datasets and creating rankings based on these preferences has many practical applications in community-based sites. This paper gives a new met...
203
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
161
click to vote
FGR
2008
IEEE
16 years 24 days ago
2008
IEEE
In this paper a novel ranking-based face recognition (FR) scheme is proposed. Compared with classical twoclass (intra/extra person) and multi-class (each person a single class) sc...
160
click to vote
SSD
2005
Springer
15 years 11 months ago
2005
Springer
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...