Sciweavers

830 search results - page 49 / 166
» Approximation power of directionlets
Sort
View
PDPTA
2003
13 years 9 months ago
Flexible Approximate String Matching Application on a Heterogeneous Distributed Environment
In this paper, we present three parallel flexible approximate string matching methods on a parallel architecture with heterogeneous workstations to gain supercomputer power at lo...
Panagiotis D. Michailidis, Konstantinos G. Margari...
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 7 months ago
Distributed Successive Approximation Coding using Broadcast Advantage: The Two-Encoder Case
Abstract-- Traditional distributed source coding rarely considers the possible link between separate encoders. However, the broadcast nature of wireless communication in sensor net...
Zichong Chen, Guillermo Barrenetxea, Martin Vetter...
CVPR
2007
IEEE
14 years 9 months ago
Fast, Approximately Optimal Solutions for Single and Dynamic MRFs
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
ISBI
2008
IEEE
14 years 8 months ago
On approximation of orientation distributions by means of spherical ridgelets
Visualization and analysis of the micro-architecture of brain parenchyma by means of magnetic resonance imaging is nowadays believed to be one of the most powerful tools used for ...
Oleg V. Michailovich, Yogesh Rathi
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
14 years 8 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...