Sciweavers

66 search results - page 8 / 14
» Efficient Matrix Chain Ordering in Polylog Time
Sort
View
CIE
2010
Springer
13 years 10 months ago
A Faster Algorithm for Finding Minimum Tucker Submatrices
A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1s on each row are consecutive. Algorithmic issues of the C1P are centr...
Guillaume Blin, Romeo Rizzi, Stéphane Viale...
JPDC
2008
138views more  JPDC 2008»
13 years 6 months ago
Efficient parallel implementation of iterative reconstruction algorithms for electron tomography
Electron tomography (ET) combines electron microscopy and the principles of tomographic imaging in order to reconstruct the threedimensional structure of complex biological specim...
José-Jesús Fernández, Dan Gor...
JCNS
2010
90views more  JCNS 2010»
13 years 1 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
EDBT
2006
ACM
255views Database» more  EDBT 2006»
14 years 6 months ago
FIS-by-Step: Visualization of the Fast Index Scan for Nearest Neighbor Queries
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
Elke Achtert, Dominik Schwald
INFOCOM
2010
IEEE
13 years 4 months ago
Distributed Coordination with Deaf Neighbors: Efficient Medium Access for 60 GHz Mesh Networks
Multi-gigabit outdoor mesh networks operating in the unlicensed 60 GHz "millimeter (mm) wave" band, offer the possibility of a quickly deployable broadband extension of t...
Sumit Singh, Raghuraman Mudumbai, Upamanyu Madhow