Sciweavers

2485 search results - page 150 / 497
» Time Bounded Frequency Computations
Sort
View
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
16 years 4 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch
IPPS
1999
IEEE
15 years 9 months ago
A Flexible Clustering and Scheduling Scheme for Efficient Parallel Computation
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...
S. Chingchit, Mohan Kumar, Laxmi N. Bhuyan
125
Voted
ICLP
1999
Springer
15 years 9 months ago
Computing Large and Small Stable Models
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
Miroslaw Truszczynski
HPDC
2011
IEEE
14 years 8 months ago
Juggle: proactive load balancing on multicore computers
We investigate proactive dynamic load balancing on multicore systems, in which threads are continually migrated to reduce the impact of processor/thread mismatches to enhance the ...
Steven Hofmeyr, Juan A. Colmenares, Costin Iancu, ...
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 5 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan