4451 search results - page 49 / 891 » On Random Ordering Constraints |
101
click to vote
COMPGEOM
1994
ACM
15 years 3 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
ASPDAC
2007
ACM
15 years 3 months ago
2007
ACM
Due to the extremely large sizes of power grids, IR drop analysis has become a computationally challenging problem both in terms of runtime and memory usage. It has been shown in [...
ECAI
2010
Springer
15 years 28 days ago
2010
Springer
We introduce First Order ProbLog, an extension of first order logic with soft constraints where formulas are guarded by probabilistic facts. The paper defines a semantics for FOPro...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we describe a technique to temporally sort a collection of photos that span many years. By reasoning about persistence of visible structures, we show how this sorti...
115
click to vote
AAAI
2011
13 years 11 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...