Sciweavers

4850 search results - page 331 / 970
» Approximate Data Structures with Applications
Sort
View
IJFCS
2006
70views more  IJFCS 2006»
15 years 6 months ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
JSAC
2008
70views more  JSAC 2008»
15 years 6 months ago
LMMSE turbo equalization based on factor graphs
Abstract--In this paper, a vector-form factor graph representation is derived for intersymbol interference (ISI) channels. The resultant graphs have a tree-structure that avoids th...
Qinghua Guo, Li Ping
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
15 years 11 months ago
Indexing multi-dimensional data in a cloud system
Providing scalable database services is an essential requirement for extending many existing applications of the Cloud platform. Due to the diversity of applications, database ser...
Jinbao Wang, Sai Wu, Hong Gao, Jianzhong Li, Beng ...
PODC
2000
ACM
15 years 11 months ago
Garbage collection of timestamped data in Stampede
Stampede is a parallel programming system to facilitate the programming of interactive multimedia applications on clusters of SMPs. In a Stampede application, a variable number of...
Rishiyur S. Nikhil, Umakishore Ramachandran
CVPR
2009
IEEE
16 years 1 months ago
On compositional Image Alignment, with an application to Active Appearance Models
Efficient and accurate fitting of Active Appearance Models (AAM) is a key requirement for many applications. The most efficient fitting algorithm today is Inverse Compositiona...
Brian Amberg, Andrew Blake, Thomas Vetter