Sciweavers

25041 search results - page 4148 / 5009
» Algorithms for Clustering Data
Sort
View
ICDCSW
2011
IEEE
14 years 7 months ago
Finding a "Kneedle" in a Haystack: Detecting Knee Points in System Behavior
—Computer systems often reach a point at which the relative cost to increase some tunable parameter is no longer worth the corresponding performance benefit. These “knees” t...
Ville Satopaa, Jeannie R. Albrecht, David Irwin, B...
ICCV
2011
IEEE
14 years 6 months ago
Correspondence Free Registration through a Point-to-Model Distance Minimization
This paper presents a novel formulation, which derives in a smooth minimization problem, to tackle the rigid registration between a given point set and a model set. Unlike most of ...
Mohammad Rouhani and Angel D. Sappa
CORR
2012
Springer
220views Education» more  CORR 2012»
14 years 3 months ago
Sparse Topical Coding
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
Jun Zhu, Eric P. Xing
FPGA
2012
ACM
285views FPGA» more  FPGA 2012»
14 years 3 months ago
Optimizing SDRAM bandwidth for custom FPGA loop accelerators
Memory bandwidth is critical to achieving high performance in many FPGA applications. The bandwidth of SDRAM memories is, however, highly dependent upon the order in which address...
Samuel Bayliss, George A. Constantinides

Presentation
945views
14 years 1 months ago
A Decentralized Method for Maximizing k-coverage Lifetime in WSNs
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...
« Prev « First page 4148 / 5009 Last » Next »