Sciweavers

3652 search results - page 524 / 731
» A study of query length
Sort
View
BNCOD
2009
145views Database» more  BNCOD 2009»
15 years 7 months ago
Compacting XML Structures Using a Dynamic Labeling Scheme
Due to the growing popularity of XML as a data exchange and storage format, the need to develop efficient techniques for storing and querying XML documents has emerged. A common ap...
Ramez Alkhatib, Marc H. Scholl
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 6 months ago
Discovery of Convoys in Trajectory Databases
As mobile devices with positioning capabilities continue to proliferate, data management for so-called trajectory databases that capture the historical movements of populations of...
Hoyoung Jeung, Man Lung Yiu, Xiaofang Zhou, Christ...
CORR
2010
Springer
124views Education» more  CORR 2010»
15 years 6 months ago
Online Learning of Noisy Data with Kernels
We study online learning when individual instances are corrupted by adversarially chosen random noise. We assume the noise distribution is unknown, and may change over time with n...
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, O...
ECCC
2010
91views more  ECCC 2010»
15 years 6 months ago
Limits on the rate of locally testable affine-invariant codes
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
Eli Ben-Sasson, Madhu Sudan
ECCC
2008
122views more  ECCC 2008»
15 years 6 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