Sciweavers

6111 search results - page 17 / 1223
» Time, Hardware, and Uniformity
Sort
View
UAI
2003
13 years 9 months ago
Strong Faithfulness and Uniform Consistency in Causal Inference
A fundamental question in causal inference is whether it is possible to reliably infer the manipulation effects from observational data. There are a variety of senses of asymptot...
Jiji Zhang, Peter Spirtes
STACS
2009
Springer
14 years 4 days ago
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...
Mahdi Cheraghchi, Amin Shokrollahi
IPL
2002
65views more  IPL 2002»
13 years 7 months ago
A new bound for map labeling with uniform circle pairs
Given a planar point set, we wish to label the points with uniform circular labels such that each input point lies on the boundary of two labels, none of the interiors of the labe...
Michael J. Spriggs, J. Mark Keil
IPPS
2007
IEEE
14 years 1 months ago
Competitive Analysis of Partitioned Scheduling on Uniform Multiprocessors
Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can b...
Björn Andersson, Eduardo Tovar
SODA
1996
ACM
95views Algorithms» more  SODA 1996»
13 years 9 months ago
RNC Algorithms for the Uniform Generation of Combinatorial Structures
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons