Sciweavers

3172 search results - page 402 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
CORR
2011
Springer
178views Education» more  CORR 2011»
14 years 10 months ago
Online Learning: Stochastic and Constrained Adversaries
Learning theory has largely focused on two main learning scenarios. The first is the classical statistical setting where instances are drawn i.i.d. from a fixed distribution and...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
COSIT
2011
Springer
269views GIS» more  COSIT 2011»
14 years 6 months ago
Analyzing the Spatial-Semantic Interaction of Points of Interest in Volunteered Geographic Information
With the increasing success and commercial integration of Volunteered Geographic Information (VGI), the focus shifts away from coverage to data quality and homogeneity. Within the ...
Christoph Mülligann, Krzysztof Janowicz, Mao ...
IS
2012
14 years 2 months ago
View determinacy for preserving selected information in data transformations
When transforming data one often wants certain information in the data source to be preserved, i.e., we identify parts of the source data and require these parts to be transformed...
Wenfei Fan, Floris Geerts, Lixiao Zheng
CRYPTO
2012
Springer
268views Cryptology» more  CRYPTO 2012»
13 years 9 months ago
Secret Sharing Schemes for Very Dense Graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Amos Beimel, Oriol Farràs, Yuval Mintz
FORMATS
2008
Springer
15 years 8 months ago
Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
The common metric temporal logics for continuous time were shown to be insufficient, when it was proved in [7, 12] that they cannot express a modality suggested by Pnueli. Moreover...
Alexander Rabinovich