Sciweavers

2370 search results - page 150 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
ICASSP
2007
IEEE
15 years 4 months ago
Fundamental Detection and Estimation Limits in Spike Sorting
Spike sorting refers to the detection and classification of electric potentials (spikes) from multi-neuron recordings, a difficult but essential pre-processing step before neura...
Mona A. Sheikh, Don H. Johnson
ICMCS
2007
IEEE
144views Multimedia» more  ICMCS 2007»
15 years 4 months ago
Parallel and Distributed Audio Concealment using Nonlocal Sparse Representations
We present a new class of parallel and distributed audio concealment (PDAC) algorithms which recover lost audio packets at the receiver to fight against channel impairment. The m...
Xin Li
FPL
2007
Springer
106views Hardware» more  FPL 2007»
15 years 4 months ago
Monte Carlo Logarithmic Number System for Model Predictive Control
Simple algorithms can be analytically characterized, but such analysis is questionable or even impossible for more complicated algorithms, such as Model Predictive Control (MPC). ...
Panagiotis D. Vouzis, Sylvain Collange, Mark G. Ar...
FSTTCS
2007
Springer
15 years 4 months ago
A Formal Investigation of
The diff3 algorithm is widely considered the gold standard for merging uncoordinated changes to list-structured data such as text files. Surprisingly, its fundamental properties h...
Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce
ISAAC
2007
Springer
111views Algorithms» more  ISAAC 2007»
15 years 4 months ago
Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...
Jiong Guo