Sciweavers

4670 search results - page 6 / 934
» Testing that distributions are close
Sort
View
PVLDB
2010
116views more  PVLDB 2010»
13 years 4 months ago
Computing Closed Skycubes
In this paper, we tackle the problem of efficient skycube computation. We introduce a novel approach significantly reducing domination tests for a given subspace and the number of...
Chedy Raïssi, Jian Pei, Thomas Kister
ECCC
2008
122views more  ECCC 2008»
13 years 9 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira
ICML
2004
IEEE
14 years 10 months ago
Testing the significance of attribute interactions
Attribute interactions are the irreducible dependencies between attributes. Interactions underlie feature relevance and selection, the structure of joint probability and classific...
Aleks Jakulin, Ivan Bratko
ICMLA
2008
13 years 11 months ago
A Weighted Distance Measure for Calculating the Similarity of Sparsely Distributed Trajectories
This article presents a method for the calculating similarity of two trajectories. The method is especially designed for a situation where the points of the trajectories are distr...
Pekka Siirtola, Perttu Laurinen, Juha Röning
TCSV
2010
13 years 4 months ago
Distributed Media-Aware Rate Allocation for Wireless Video Streaming
This paper addresses the rate allocation problem for wireless video streaming. Results from a simple subjective viewing test indicate that perceptually preferred allocation can be...
Xiaoqing Zhu, Bernd Girod