Sciweavers

360 search results - page 34 / 72
» Precision-at-ten considered redundant
Sort
View
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 11 months ago
Rebuilding for Array Codes in Distributed Storage Systems
In distributed storage systems that use coding, the issue of minimizing the communication required to rebuild a storage node after a failure arises. We consider the problem of repa...
Zhiying Wang, Alexandros G. Dimakis, Jehoshua Bruc...
PRL
2006
117views more  PRL 2006»
13 years 10 months ago
Feature selection in robust clustering based on Laplace mixture
A wrapped feature selection process is proposed in the context of robust clustering based on Laplace mixture models. The clustering approach we consider is a generalization of the...
Aurélien Cord, Christophe Ambroise, Jean Pi...
TCOM
2008
136views more  TCOM 2008»
13 years 10 months ago
Joint source-channel codes based on irregular turbo codes and variable length codes
Abstract--Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in the presence of noisy channels. To address this problem, several joint ...
Xavier Jaspar, Luc Vandendorpe
CORR
2004
Springer
85views Education» more  CORR 2004»
13 years 10 months ago
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara
AI
1999
Springer
13 years 10 months ago
Information Retrieval and Artificial Intelligence
This paper addresses the relations between information retrieval (IR) and AI. It examines document retrieval, summarising its essential features and illustrating the state of its ...
Karen Sparck Jones