Sciweavers

3360 search results - page 289 / 672
» Opportunistic Data Structures with Applications
Sort
View
CIKM
2006
Springer
15 years 6 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
157
Voted
IWPSE
2005
IEEE
15 years 10 months ago
EvoLens: Lens-View Visualizations of Evolution Data
Visualizing software evolution is essential for identifying design erosions that have occurred over the past releases. Making evolutionary aspects explicit via visual representati...
Jacek Ratzinger, Michael Fischer, Harald Gall
166
Voted
BMCBI
2010
97views more  BMCBI 2010»
15 years 5 months ago
Kinome-wide interaction modelling using alignment-based and alignment-independent approaches for kinase description and linear a
Background: Protein kinases play crucial roles in cell growth, differentiation, and apoptosis. Abnormal function of protein kinases can lead to many serious diseases, such as canc...
Maris Lapinsh, Jarl E. S. Wikberg
169
Voted
CORR
2010
Springer
275views Education» more  CORR 2010»
15 years 5 months ago
Dictionary Optimization for Block-Sparse Representations
Recent work has demonstrated that using a carefully designed dictionary instead of a predefined one, can improve the sparsity in jointly representing a class of signals. This has m...
Kevin Rosenblum, Lihi Zelnik-Manor, Yonina C. Elda...
143
Voted
CIKM
2005
Springer
15 years 10 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu