Sciweavers

1567 search results - page 216 / 314
» Compressing Relations and Indexes
Sort
View
AMSTERDAM
2009
13 years 8 months ago
There Is Something about Might
In this paper we present an alternative interpretation of statements of epistemic possibility, which does not induce a consistency test on a common ground, as in (Veltman 1996), bu...
Paul Dekker
ICIP
2001
IEEE
14 years 12 months ago
Coding for the storage and communication of visualisations of 3D medical data
The transmission of the large store of information contained in 3D medical data sets through limited capacity channels, is a critical procedure in many telemedicine applications. ...
Dimitrios Tzovaras, Michael G. Strintzis, Nikolaos...
POPL
2007
ACM
14 years 10 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi
KDD
2009
ACM
189views Data Mining» more  KDD 2009»
14 years 5 months ago
CoCo: coding cost for parameter-free outlier detection
How can we automatically spot all outstanding observations in a data set? This question arises in a large variety of applications, e.g. in economy, biology and medicine. Existing ...
Christian Böhm, Katrin Haegler, Nikola S. M&u...
AUSAI
2007
Springer
14 years 4 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan