Sciweavers

1217 search results - page 174 / 244
» On compressing frequent patterns
Sort
View
CORR
2011
Springer
195views Education» more  CORR 2011»
14 years 11 months ago
Context-aware Authorization in Highly Dynamic Environments
Highly dynamic computing environments, like ubiquitous and pervasive computing environments, require frequent adaptation of applications. Context is a key to adapt suiting user ne...
Jean-Yves Tigli, Stephane Lavirotte, Gaëtan R...
127
Voted
FOCM
2010
122views more  FOCM 2010»
15 years 1 months ago
Scattering in Flatland: Efficient Representations via Wave Atoms
This paper presents a numerical compression strategy for the boundary integral equation of acoustic scattering in two dimensions. These equations have oscillatory kernels that we ...
Laurent Demanet, Lexing Ying
157
Voted
SIGIR
2011
ACM
14 years 6 months ago
Inverted indexes for phrases and strings
Inverted indexes are the most fundamental and widely used data structures in information retrieval. For each unique word occurring in a document collection, the inverted index sto...
Manish Patil, Sharma V. Thankachan, Rahul Shah, Wi...
ICDM
2008
IEEE
96views Data Mining» more  ICDM 2008»
15 years 10 months ago
Filling in the Blanks - Krimp Minimisation for Missing Data
Many data sets are incomplete. For correct analysis of such data, one can either use algorithms that are designed to handle missing data or use imputation. Imputation has the bene...
Jilles Vreeken, Arno Siebes
APGV
2005
ACM
125views Visualization» more  APGV 2005»
15 years 9 months ago
Designing a tone mapping algorithm for road visibility experiments
In this paper, we propose a tone mapping operator based on a multiscale representation pattern and on thresholds of detection contrast computed for local adaptation luminances. Th...
Justine Grave, Roland Brémond