Sciweavers

9405 search results - page 1064 / 1881
» Computing a Model of Set Theory
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 7 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
PODS
2003
ACM
135views Database» more  PODS 2003»
16 years 7 months ago
Query-preserving watermarking of relational databases and XML documents
Watermarking allows robust and unobtrusive insertion of information in a digital document. Very recently, techniques have been proposed for watermarking relational databases or XM...
David Gross-Amblard
SDM
2009
SIAM
191views Data Mining» more  SDM 2009»
16 years 4 months ago
Adaptive Concept Drift Detection.
An established method to detect concept drift in data streams is to perform statistical hypothesis testing on the multivariate data in the stream. Statistical decision theory off...
Anton Dries, Ulrich Rückert
ICCAD
2002
IEEE
104views Hardware» more  ICCAD 2002»
16 years 4 months ago
A new enhanced SPFD rewiring algorithm
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...
Jason Cong, Joey Y. Lin, Wangning Long
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
16 years 2 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day
« Prev « First page 1064 / 1881 Last » Next »