Sciweavers

943 search results - page 77 / 189
» How should data structures and algorithms be taught
Sort
View
BIBE
2007
IEEE
195views Bioinformatics» more  BIBE 2007»
15 years 9 months ago
Finding Clusters of Positive and Negative Coregulated Genes in Gene Expression Data
— In this paper, we propose a system for finding partial positive and negative coregulated gene clusters in microarray data. Genes are clustered together if they show the same p...
Kerstin Koch, Stefan Schönauer, Ivy Jansen, J...
LCTRTS
2007
Springer
15 years 9 months ago
Compiler-managed partitioned data caches for low power
Set-associative caches are traditionally managed using hardwarebased lookup and replacement schemes that have high energy overheads. Ideally, the caching strategy should be tailor...
Rajiv A. Ravindran, Michael L. Chu, Scott A. Mahlk...
UAI
1997
15 years 4 months ago
Nonuniform Dynamic Discretization in Hybrid Networks
We consider probabilistic inference in general hybrid networks, which include continuous and discrete variables in an arbitrary topology. We reexamine the question of variable dis...
Alexander V. Kozlov, Daphne Koller
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
16 years 8 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer
CAV
2010
Springer
239views Hardware» more  CAV 2010»
15 years 7 months ago
Model Checking of Linearizability of Concurrent List Implementations
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
Pavol Cerný, Arjun Radhakrishna, Damien Zuf...