Sciweavers

158 search results - page 27 / 32
» Instruction Based Memory Distance Analysis and its Applicati...
Sort
View
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
15 years 9 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
SIGMOD
2010
ACM
210views Database» more  SIGMOD 2010»
14 years 12 months ago
Searching trajectories by locations: an efficiency study
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Yu Zhen...
ESTIMEDIA
2009
Springer
15 years 6 months ago
QoS management of dynamic video tasks by task splitting and skipping
—We have integrated processing with deterministic and non-deterministic resource usage in an overall application and evaluated its performance on a multi-core processor platform....
Rob Albers, Eric Suijs, Peter H. N. de With
SIGMOD
2002
ACM
132views Database» more  SIGMOD 2002»
15 years 12 months ago
Clustering by pattern similarity in large data sets
Clustering is the process of grouping a set of objects into classes of similar objects. Although definitions of similarity vary from one clustering model to another, in most of th...
Haixun Wang, Wei Wang 0010, Jiong Yang, Philip S. ...
VLDB
2004
ACM
163views Database» more  VLDB 2004»
15 years 5 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...