Sciweavers

653 search results - page 57 / 131
» The size of minimum 3-trees
Sort
View
ICDE
2012
IEEE
223views Database» more  ICDE 2012»
13 years 2 months ago
Incremental Detection of Inconsistencies in Distributed Data
—This paper investigates the problem of incremental detection of errors in distributed data. Given a distributed database D, a set Σ of conditional functional dependencies (CFDs...
Wenfei Fan, Jianzhong Li, Nan Tang, Wenyuan Yu
EMSOFT
2004
Springer
15 years 5 months ago
Garbage collection for embedded systems
Security concerns on embedded devices like cellular phones make Java an extremely attractive technology for providing third-party and user-downloadable functionality. However, gar...
David F. Bacon, Perry Cheng, David Grove
RANDOM
1998
Springer
15 years 4 months ago
On-Line Bin-Stretching
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
Yossi Azar, Oded Regev
IJCAI
1997
15 years 1 months ago
A Study of Causal Discovery With Weak Links and Small Samples
Weak causal relationships and small sample size pose two significant difficulties to the automatic discovery of causal models from observational data. This paper examines the infl...
Honghua Dai, Kevin B. Korb, Chris S. Wallace, Xind...
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
16 years 1 hour ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner