Sciweavers

1458 search results - page 96 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
SIGMOD
2004
ACM
160views Database» more  SIGMOD 2004»
16 years 6 months ago
Extending Query Rewriting Techniques for Fine-Grained Access Control
Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views,...
Shariq Rizvi, Alberto O. Mendelzon, S. Sudarshan, ...
KBSE
2005
IEEE
15 years 11 months ago
Visualization-based analysis of quality for large-scale software systems
We propose an approach for complex software analysis based on visualization. Our work is motivated by the fact that in spite of years of research and practice, software developmen...
Guillaume Langelier, Houari A. Sahraoui, Pierre Po...
ITCC
2003
IEEE
15 years 11 months ago
Fast Prefix Code Processing
As large main memory becomes more and more available at reasonable prices, processing speed of large data sets becomes more important than reducing main memory usage of internal d...
Renato Pajarola
RECOMB
2003
Springer
16 years 6 months ago
Accurate detection of very sparse sequence motifs
Protein sequence alignments are more reliable the shorter the evolutionary distance. Here, we align distantly related proteins using many closely spaced intermediate sequences as ...
Andreas Heger, Michael Lappe, Liisa Holm
CGF
2010
171views more  CGF 2010»
15 years 2 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu