Sciweavers

11862 search results - page 204 / 2373
» Relative information completeness
Sort
View
IDA
2011
Springer
14 years 10 months ago
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
Annalisa Appice, Michelangelo Ceci, Antonio Turi, ...
170
Voted
PRDC
2009
IEEE
15 years 10 months ago
Quantifying Criticality of Dependability-Related IT Organization Processes in CobiT
—With ever-growing complexity of computer and communication systems analytical methods do not scale, especially with respect to dependability assessment of information technology...
Tobias Goldschmidt, Andreas Dittrich, Miroslaw Mal...
TSP
2008
117views more  TSP 2008»
15 years 3 months ago
Sample Eigenvalue Based Detection of High-Dimensional Signals in White Noise Using Relatively Few Samples
The detection and estimation of signals in noisy, limited data is a problem of interest to many scientific and engineering communities. We present a mathematically justifiable, com...
R. R. Nadakuditi, A. Edelman
SIGIR
2012
ACM
13 years 6 months ago
Content-based retrieval for heterogeneous domains: domain adaptation by relative aggregation points
We introduce the problem of domain adaptation for content-based retrieval and propose a domain adaptation method based on relative aggregation points (RAPs). Content-based retriev...
Makoto P. Kato, Hiroaki Ohshima, Katsumi Tanaka
IJCAI
2003
15 years 5 months ago
Efficient Execution of Recursive Integration Plans
Information integration systems provide a uniform query interface to a set of sources. One of the key challenges for an information integration system is to provide maximally comp...
Snehal Thakkar, Craig A. Knoblock