Sciweavers

2040 search results - page 300 / 408
» Approximate Expectation Maximization
Sort
View
130
Voted
DAC
2008
ACM
16 years 4 months ago
Miss reduction in embedded processors through dynamic, power-friendly cache design
Today, embedded processors are expected to be able to run complex, algorithm-heavy applications that were originally designed and coded for general-purpose processors. As a result...
Garo Bournoutian, Alex Orailoglu
ISBI
2008
IEEE
16 years 4 months ago
Improving single particle localization with an empirically calibrated Gaussian kernel
Accurate computational localization of single fluorescent particles is of interest to many biophysical studies and underlies recent approaches to high resolution microscopy using ...
Marcio de Moraes Marim, Bo Zhang, Jean-Christophe ...
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
16 years 3 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
118
Voted
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 3 months ago
Fully-dynamic min-cut
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
Mikkel Thorup
SAC
2010
ACM
15 years 10 months ago
A wavelet-based sampling algorithm for wireless sensor networks applications
This work proposes and evaluates a sampling algorithm based on wavelet transforms with Coiflets basis to reduce the data sensed in wireless sensor networks applications. The Coiï...
André L. L. de Aquino, Ricardo A. R. Olivei...