1458 search results - page 2 / 292 » Practical Preference Relations for Large Data Sets |
CHI
2009
ACM
14 years 7 days 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...
IDA
2011
Springer
13 years 12 days ago
2011
Springer
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
ICDE
1994
IEEE
13 years 9 months ago
1994
IEEE
The relational data model is based on sets of tuples, i.e. it does not allow duplicate tuples in a relation. Many database languages and systems do require multi-set place, the hi...
ICDE
2010
IEEE
14 years 10 days ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
MICRO
1994
IEEE
13 years 9 months ago
1994
IEEE
Numerical applications frequently contain nested loop structures that process large arrays of data. The execution of these loop structures often produces memory preference pattern...