Sciweavers

4066 search results - page 169 / 814
» Almost Complete Sets
Sort
View
FOCS
1999
IEEE
15 years 10 months ago
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
We show that no Markovian Coupling argument can prove rapid mixing of the Jerrum-Sinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect match...
V. S. Anil Kumar, H. Ramesh
SIGMETRICS
1998
ACM
15 years 10 months ago
Predicting MPEG Execution Times
This paper reports on a set of experiments that measure the amount of CPU processing needed to decode MPEGcompressed video in software. These experiments were designed to discover...
Andy C. Bavier, Allen Brady Montz, Larry L. Peters...
ECOOP
1997
Springer
15 years 10 months ago
Feature-Oriented Programming: A Fresh Look at Objects
We propose a new model for exible composition of objects et of features. Features are similar to (abstract) subclasses, but only provide the core functionality of a (sub)class. Ove...
Christian Prehofer
VLDB
1997
ACM
112views Database» more  VLDB 1997»
15 years 10 months ago
Selectivity Estimation Without the Attribute Value Independence Assumption
The result size of a query that involves multiple attributes from the same relation depends on these attributes’ joint data distribution,i.e., the frequencies of all combination...
Viswanath Poosala, Yannis E. Ioannidis
STOC
1994
ACM
125views Algorithms» more  STOC 1994»
15 years 10 months ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
Noga Alon, Nabil Kahale