Sciweavers

1458 search results - page 85 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
ICS
2005
Tsinghua U.
15 years 10 months ago
The implications of working set analysis on supercomputing memory hierarchy design
Supercomputer architects strive to maximize the performance of scientific applications. Unfortunately, the large, unwieldy nature of most scientific applications has lead to the...
Richard C. Murphy, Arun Rodrigues, Peter M. Kogge,...
142
Voted
CHI
1997
ACM
15 years 9 months ago
Focus+Context Visualization with Flip Zooming and the Zoom Browser
Flip zooming is a novel focus+context technique for visualizing large data sets. It offers an overview of the data, and gives users instant access to any part. Originally develope...
Lars Erik Holmquist
140
Voted
SIGMOD
2000
ACM
212views Database» more  SIGMOD 2000»
15 years 9 months ago
SQLEM: Fast Clustering in SQL using the EM Algorithm
Clustering is one of the most important tasks performed in Data Mining applications. This paper presents an e cient SQL implementation of the EM algorithm to perform clustering in...
Carlos Ordonez, Paul Cereghini
DEXA
2006
Springer
116views Database» more  DEXA 2006»
15 years 7 months ago
Interpolating and Using Most Likely Trajectories in Moving-Objects Databases
In recent years, many emerging database applications deal with large sets of continuously moving data objects. Since no computer system can commit continuously occurring infinitesi...
Byunggu Yu, Seon Ho Kim
ACMSE
2005
ACM
15 years 10 months ago
The bipartite clique: a topological paradigm for WWWeb user search customization
Web user search customization research has been fueled by the recognition that if the WWW is to attain to its optimal potential as an interactive medium the development of new and...
Brenda F. Miles, Vir V. Phoha