Sciweavers

5785 search results - page 639 / 1157
» Approximability of Probability Distributions
Sort
View
IPPS
2008
IEEE
16 years 1 months ago
Model-based fault localization in large-scale computing systems
We propose a new fault localization technique for software bugs in large-scale computing systems. Our technique always collects per-process function call traces of a target system...
Naoya Maruyama, Satoshi Matsuoka
COLT
2001
Springer
15 years 11 months ago
On Using Extended Statistical Queries to Avoid Membership Queries
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
Nader H. Bshouty, Vitaly Feldman
TOMACS
2010
182views more  TOMACS 2010»
15 years 5 months ago
State-dependent importance sampling for a Jackson tandem network
This paper considers importance sampling as a tool for rare-event simulation. The focus is on estimating the probability of overflow in the downstream queue of a Jacksonian two-n...
Denis I. Miretskiy, Werner R. W. Scheinhardt, Mich...
DIS
2009
Springer
16 years 1 months ago
A Sliding Window Algorithm for Relational Frequent Patterns Mining from Data Streams
Some challenges in frequent pattern mining from data streams are the drift of data distribution and the computational efficiency. In this work an additional challenge is considered...
Fabio Fumarola, Anna Ciampi, Annalisa Appice, Dona...
SPIRE
2009
Springer
16 years 1 months ago
A Last-Resort Semantic Cache for Web Queries
We propose a method to evaluate queries using a last-resort semantic cache in a distributed Web search engine. The cache stores a group of frequent queries and for each of these qu...
Flavio Ferrarotti, Mauricio Marín, Marcelo ...