Sciweavers

715 search results - page 7 / 143
» Second step algorithms in the Burrows-Wheeler compression al...
Sort
View
NAACL
2010
13 years 5 months ago
From Baby Steps to Leapfrog: How "Less is More" in Unsupervised Dependency Parsing
We present three approaches for unsupervised grammar induction that are sensitive to data complexity and apply them to Klein and Manning's Dependency Model with Valence. The ...
Valentin I. Spitkovsky, Hiyan Alshawi, Daniel Jura...
ICC
2011
IEEE
236views Communications» more  ICC 2011»
12 years 7 months ago
0 to 10k in 20 Seconds: Bootstrapping Large-Scale DHT Networks
—A handful of proposals address the problem of bootstrapping a large DHT network from scratch, but they all forgo the standard DHT join protocols in favor of their own distribute...
Jae Woo Lee, Henning Schulzrinne, Wolfgang Kellere...
TIP
2010
111views more  TIP 2010»
13 years 2 months ago
Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a classical demosaicking algorithm based on alternating projections (AP), propos...
Yue M. Lu, Mina Karzand, Martin Vetterli
MICCAI
2004
Springer
14 years 8 months ago
Medical Image Segmentation Based on Mutual Information Maximization
Abstract. In this paper we propose a two-step mutual informationbased algorithm for medical image segmentation. In the first step, the image is structured into homogeneous regions,...
Jaume Rigau, Miquel Feixas, Mateu Sbert, Anton Bar...
DCC
2000
IEEE
13 years 12 months ago
Lossless Compression of High-Volume Numerical Data from Simulations
Applications in scientific computing operate with high-volume numerical data and the occupied space should be reduced. Traditional compression algorithms cannot provide sufficie...
Vadim Engelson, Dag Fritzson, Peter Fritzson